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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 1238:
0 = fs0[ri0[inodekey(m)]].nsubdirs, ¬ boolvar1, buf-opt = buf-opt0, adr1 ≠ adr2, fs0[ri0[inodekey(m)]].inode?, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, ¬ fs0[ri0[inodekey(m)]].directory, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced → boolvar0 ⊦ [m0 := fs0[ri0[inodekey(m)]].nlink; if boolvar1 then buf-opt := some(inodenode(inodekey(m), md, false, m0, 0, n0).data)] ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0)) ∧ ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])) ∧ m ≠ 0 → ⟨p_inode := mkinode(m, md, false, m0, 0, m2); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_truncate#(n0, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err0, dirs, files, asynced)⟩ ( dirs = abs-dirs (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2]) ∧ files = abs-files (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])) ∧ orphans (abs-dirs (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2]), abs-files (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0)], ri0[inodekey(m), adr2])) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, 0, n0) = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err0)), m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (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).directory ↔ boolvar; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).meta = md; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ orphans (abs-dirs(fs, ri), abs-files(fs, ri \ datakeys(inodekey(ino), n, ri))) = orphans(abs-dirs(fs, ri), abs-files(fs, ri)); (s)% ⊦ abs-dirs(fs, ri \ datakeys(key, n, ri)) = abs-dirs(fs, ri); (s)% ⊦ ¬ inodenode(key, md, boolvar, m, m0, m1).trunc?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)