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

boolvar4 ↔ boolvar, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs0[ri[inodekey(m)]] = inodenode(key, md0, false, m3, 0, m5), adr = adr3, adr0 = adr2, adr4 = adr1, adr6 = adr5, dirs = abs-dirs(fs0, ri), err = ESUCCESS, err0 = err, files = abs-files(fs0, ri), fs = fs0[adr4, nd1][adr0, nd0][adr, nd], log = ((log0 + adr4) + adr0) + adr, m1 = m, nd = nd2.data:= fill(nd2.data, zero, m2 % VFS_PAGE_SIZE, n0), nd0 = inodenode(inodekey(m), md, false, m3, 0, n), nd1 = truncnode(inodekey(m), m2), nd2 = fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]], ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), nd2.data?, fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, 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), new(adr1 ' + (adr2 ' + adr3), fs0), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-cons(ri, fs0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri, m2 % VFS_PAGE_SIZE + n0 ≤ # nd2.data, m2 ≤ n, asynced → boolvar0 ⊦ [if err0 = ESUCCESS then aubifs_core_index_store#(datakey(m1, m2 / VFS_PAGE_SIZE), adr, fi, ro0, fo, fs, log, boolvar4; ri); buf-opt := buf-opt0; boolvar1 := boolvar2; nd2.data := fill(nd2.data, zero, m2 % VFS_PAGE_SIZE, n0); inode := mkinode(m1, md, false, m3, 0, m2); if err0 = ESUCCESS then {aubifs_core_index_store#(inodekey(m1), adr0, fi, ro0, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro0, fo, fs, log, boolvar4; ri); boolvar1 := true; inode := mkinode (inode.ino, inodenode(inodekey(m), md, false, m3, 0, n).meta, inodenode(inodekey(m), md, false, m3, 0, n).directory, inodenode(inodekey(m), md, false, m3, 0, n).nlink, inodenode(inodekey(m), md, false, m3, 0, n).nsubdirs, inodenode(inodekey(m), md, false, m3, 0, n).size); if boolvar1 then buf-opt := some(nd2.data)}] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨p_inode := mkinode(m, md, false, m3, 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ err0 = err1)), m2 % VFS_PAGE_SIZE = 0, VFS_PAGE_SIZE = 0, buf-opt0.some?, dups(adr1 ' + adr2 ' + adr3 ')

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information