[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1085 from proof refine-truncate (previous step)

fs0[ri0[inodekey(m)]] = inodenode(key0, md0, false, m1, 0, m4), abs-files(fs0, ri0)[m] = mkfile(m0, md1, m3, content0), dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0)[m, mkfile(m0, md1, m3, content0 upto m2)], ino = inode.ino, inode = mkinode(m, md, false, m1, 0, n0), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2])), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ino ∈ dirs, m2 ≤ n0, asynced → boolvar0 ⊦ ⟨asynced := ?⟩ ( afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files) → dirs[ino, dirs[ino].meta:= inode.meta] = abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2]) ∧ files = abs-files (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2])) ∧ orphans (abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2]), abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2])) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar4) ∧ mkinode(m, md, false, m1, 0, n0) = (m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) ∧ ESUCCESS = ESUCCESS), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, m = 0, buf-opt0.some?, m2 / VFS_PAGE_SIZE ∈ content0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, ino ∈ files

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (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)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nsubdirs = m0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)