[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 881 from proof refine-truncate (previous step)

boolvar ↔ boolvar4, boolvar1 ↔ false, fs0[ri0[inodekey(m)]] = inodenode(key0, md0, false, m1, 0, m4), buf-opt = buf-opt0, fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], key = inodekey(m), ks = datakeys(key, n, ri), log = (log0 + adr1 ') + adr2 ', n = m2, ri = ri0[inodekey(m), adr2], ro = orphans(fs0, ri0), inodenode(inodekey(m), md, false, m1, 0, n0).inode?, 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)], ri \ ks), 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)], ri \ ks, 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)], ri \ ks, orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri \ ks), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks, 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, m2 ≤ n0, asynced → boolvar0, inodenode(inodekey(m), md, false, m1, 0, n0).trunc? ∨ inodenode(inodekey(m), md, false, m1, 0, n0).inode? ⊦ ⟨p_inode := mkinode(m, md, false, m1, 0, m2); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_truncate#(n0, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks) ∧ files = abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks) ∧ orphans (abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks), abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks)) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ mkinode (m, inodenode(inodekey(m), md, false, m1, 0, n0).meta, inodenode(inodekey(m), md, false, m1, 0, n0).directory, inodenode(inodekey(m), md, false, m1, 0, n0).nlink, inodenode(inodekey(m), md, false, m1, 0, n0).nsubdirs, inodenode(inodekey(m), md, false, m1, 0, n0).size) = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err1), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, m = 0, buf-opt0.some?, adr2 ∈ fs0, adr1 ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 882:
boolvar1 ↔ false, boolvar ↔ boolvar4, fs0[ri0[inodekey(m)]] = inodenode(key0, md0, false, m1, 0, m4), buf-opt = buf-opt0, fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], key = inodekey(m), ks = datakeys(key, n, ri), log = (log0 + adr1 ') + adr2 ', n = m2, p_inode = mkinode(m, md, false, m1, 0, m2), ri = ri0[inodekey(m), adr2], ro = orphans(fs0, ri0), inodenode(inodekey(m), md, false, m1, 0, n0).inode?, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks, orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ri-inj(fi), ri-inj(ri0), ri-inj(ri \ ks), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks, orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, m2 ≤ n0, asynced → boolvar0, inodenode(inodekey(m), md, false, m1, 0, n0).trunc? ∨ inodenode(inodekey(m), md, false, m1, 0, n0).inode? ⊦ ⟨files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_truncate#(n0, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks) ∧ files = abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks) ∧ orphans (abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks), abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri \ ks)) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ mkinode (m, inodenode(inodekey(m), md, false, m1, 0, n0).meta, inodenode(inodekey(m), md, false, m1, 0, n0).directory, inodenode(inodekey(m), md, false, m1, 0, n0).nlink, inodenode(inodekey(m), md, false, m1, 0, n0).nsubdirs, inodenode(inodekey(m), md, false, m1, 0, n0).size) = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err1), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, m = 0, buf-opt0.some?, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0

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

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information