Proof step 348 from proof refine-link (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 349:

  fs[ri[dentrykey(ino2, str)]].ino = fs[ri[dentrykey(ino3, str)]].ino, fs[ri[dentrykey(ino1, str)]].ino = fs[ri[dentrykey(ino3, str)]].ino, fs[ri[inodekey(fs[ri[dentrykey(ino3, str)]].ino)]] = inodenode(key1, md2, false, m3, 0, m5), fs[ri[dentrykey(ino0, str)]] = dentrynode(key, fs[ri[dentrykey(ino3, str)]].ino), fs[ri[inodekey(m)]] = inodenode(key0, md1, true, m0, m1, m2), dirs = abs-dirs(fs, ri)[m, mkdir(m2 + 1, md1, m0, m1, abs-children(m, fs, ri)[str0, fs[ri[dentrykey(ino3, str)]].ino])], files = abs-files(fs, ri), fs[ri[dentrykey(ino3, str)]].ino ≠ 0, m ≠ 0, fs[ri[dentrykey(ino2, str)]].dentry?, fs[ri[inodekey(ino3)]].directory, fs[ri[inodekey(ino2)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(ino0)]].directory, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(ino3, str) ∈ ri, inodekey(ino3) ∈ ri, dentrykey(ino0, str) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, inodekey(ino1) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(ino0) ∈ ri, ri[inodekey(fs[ri[dentrykey(ino3, str)]].ino)] ∈ fs, inodekey(fs[ri[dentrykey(ino3, str)]].ino) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, inodekey(ino2) ∈ ri, ri[dentrykey(ino2, str)] ∈ fs, dentrykey(ino2, str) ∈ ri, ⌊err0⌋ , ¬ dentrykey(m, str0) ∈ ri, asynced → boolvar0, links(ino3, abs-dirs(fs, ri)) ≠ ∅ ∨ ino3 = ROOT_INO, m3 ≠ 0 ∨ fs[ri[dentrykey(ino3, str)]].ino = ROOT_INO, fs[ri[inodekey(ino2)]].nlink ≠ 0 ∨ ino2 = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, m0 ≠ 0 ∨ m = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, links(fs[ri[dentrykey(ino3, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino3, str)]].ino = ROOT_INO ⊦ ⟨fail#(; ; err); asynced := ?⟩ ((asynced → boolvar) ∧ err0 = err), ⟨afs_inc_nlink#(mkdentry(str, fs[ri[dentrykey(ino2, str)]].ino).ino; dirs, files); new_dent := mkdentry(str0, mkdentry(str, fs[ri[dentrykey(ino2, str)]].ino).ino); afs_inode_sync#(mkinode(m, md, true, m0, m1, m2); dirs, files); afs_inode_sync#(mkinode(fs[ri[dentrykey(ino2, str)]].ino, md0, false, m3, 0, m6); dirs, files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := getinode(mkdentry(str, fs[ri[dentrykey(ino2, str)]].ino).ino, dirs, files); err := ESUCCESS; asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m, md, true, m0, m1, m2) = p_inode ∧ mkinode(fs[ri[dentrykey(ino2, str)]].ino, md0, false, m3, 0, m6) = c_inode ∧ negdentry(str0) = new_dent ∧ err0 = err), m3 = 0 ∧ fs[ri[dentrykey(ino3, str)]].ino ≠ ROOT_INO, m0 = 0 ∧ m ≠ ROOT_INO, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries).size:= m2 = mkdir(m2, md, m0, m1, entries); (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nsubdirs = m0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).meta = md; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)%ubifs-parent-in: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ dirs[ino, ad][ino, ad0] = dirs[ino, ad0]; (s)%⊦ mkdir(m, md, m0, m1, entries).entries:= entries0 = mkdir(m, md, m0, m1, entries0); (s)% ⊦ mkdir(m, md, m0, m1, entries).entries = entries; (s)%⊦ abs-dir(ino, fs, ri) = mkdir (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, fs[ri[inodekey(ino)]].nsubdirs, abs-children(ino, fs, ri)); (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ mkdentry(str, m).ino = m; (s)