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

boolvar ↔ boolvar4, fs0[ri[inodekey(m)]] = inodenode(key0, md0, false, m1, 0, m4), adr = adr2, dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], key = inodekey(m), log = (log0 + adr1 ') + adr2 ', ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), fo.inodes?, orphans(fs0, ri).inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri, m2 ≤ n, asynced → boolvar0 ⊦ [if ¬ adr ∈ ri ∧ adr ∈ fs ∧ key-cons(key, fs[adr]) then ri[key] := adr else abort; aubifs_core_index_truncate# (inodekey(m), min(n, m2), fi, ro0, fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], (log0 + adr1 ') + adr2 ', boolvar4 ; ri); boolvar1 := false; inode := mkinode (m, inodenode(inodekey(m), md, false, m1, 0, n).meta, inodenode(inodekey(m), md, false, m1, 0, n).directory, inodenode(inodekey(m), md, false, m1, 0, n).nlink, inodenode(inodekey(m), md, false, m1, 0, n).nsubdirs, inodenode(inodekey(m), md, false, m1, 0, n).size); buf-opt := buf-opt0; if boolvar1 then buf-opt := some(inodenode(inodekey(m), md, false, m1, 0, n).data)] ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri, ro0, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri, ro0, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri) ∧ orphans-cons(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri, ro0) ∧ ri-inj(ri) ∧ m ≠ 0 → ⟨p_inode := mkinode(m, md, false, m1, 0, m2); afs_truncate#(n, 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, n)], ri) ∧ files = abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri) ∧ orphans (abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri), abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri)) = abs-keys(ro0) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err1)), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, buf-opt0.some?, adr2 ∈ fs0, adr1 ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 871:
boolvar ↔ boolvar4, fs0[ri[inodekey(m)]] = inodenode(key0, md0, false, m1, 0, m4), adr = adr2, dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], key = inodekey(m), log = (log0 + adr1 ') + adr2 ', ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), orphans(fs0, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs0, m2 ≤ n, asynced → boolvar0 ⊦ [ri[key] := adr; aubifs_core_index_truncate# (inodekey(m), min(n, m2), fi, ro0, fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], (log0 + adr1 ') + adr2 ', boolvar4 ; ri); boolvar1 := false; inode := mkinode (m, inodenode(inodekey(m), md, false, m1, 0, n).meta, inodenode(inodekey(m), md, false, m1, 0, n).directory, inodenode(inodekey(m), md, false, m1, 0, n).nlink, inodenode(inodekey(m), md, false, m1, 0, n).nsubdirs, inodenode(inodekey(m), md, false, m1, 0, n).size); buf-opt := buf-opt0; if boolvar1 then buf-opt := some(inodenode(inodekey(m), md, false, m1, 0, n).data)] ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri, ro0, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri, ro0, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri) ∧ orphans-cons(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri, ro0) ∧ ri-inj(ri) ∧ m ≠ 0 → ⟨p_inode := mkinode(m, md, false, m1, 0, m2); afs_truncate#(n, 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, n)], ri) ∧ files = abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri) ∧ orphans (abs-dirs(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri), abs-files(fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n)], ri)) = abs-keys(ro0) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err1)), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, buf-opt0.some?, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, adr1 ∈ fs0, adr2 ∈ fs0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)%⊦ key-cons(inodekey(ino), nd) ↔ nd.inode? ∧ nd.key = inodekey(ino) ∧ ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)% ⊦ adr ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → adr ∈ fs; (ss)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ inodekey(0) ∈ ri; (s)