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

0 = fs[ri[inodekey(m)]].nsubdirs, adr = adr2, adr0 = adr1, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), m0 = fs[ri[inodekey(m)]].nlink, nd = inodenode(inodekey(m), md, false, m0, 0, n), nd0 = truncnode(inodekey(m), min(n, m2)), ro = orphans(fs, ri), ro0 = orphans(fs, ri), fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced → boolvar4 ⊦ [if ri-cons(ri, fs) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2 with new(adr1 ' + adr2 ', fs) ∧ ¬ dups(adr1 ' + adr2 ') in {adr0 := adr1, adr := adr2; fs := fs[adr0, nd0][adr, nd], log := (log + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr0 := ?, adr := ?}; boolvar := ?} else abort; nd0 := inodenode(inodekey(m), md, false, m0, 0, n); buf-opt := buf-opt0; boolvar1 := boolvar2; inode := mkinode(m, md, false, m0, 0, m2); boolvar4 := boolvar, adr2 := adr; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr2, fi, ro0, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro0, fo, fs, log, boolvar4; ri); boolvar1 := false; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); if boolvar1 then buf-opt := some(nd.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, m0, 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err0, 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) ∧ err = err0)), fs[ri[inodekey(m)]].directory, m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 1215:
0 = fs[ri[inodekey(m)]].nsubdirs, adr = adr2, adr0 = adr1, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), m0 = fs[ri[inodekey(m)]].nlink, nd = inodenode(inodekey(m), md, false, m0, 0, n), nd0 = truncnode(inodekey(m), min(n, m2)), ro = orphans(fs, ri), ro0 = orphans(fs, ri), orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, asynced → boolvar4, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE ⊦ [ choose adr1, adr2 with new(adr1 ' + adr2 ', fs) ∧ ¬ dups(adr1 ' + adr2 ') in {adr0 := adr1, adr := adr2; fs := fs[adr0, nd0][adr, nd], log := (log + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr0 := ?, adr := ?}; boolvar := ?; nd0 := inodenode(inodekey(m), md, false, m0, 0, n); buf-opt := buf-opt0; boolvar1 := boolvar2; inode := mkinode(m, md, false, m0, 0, m2); boolvar4 := boolvar, adr2 := adr; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr2, fi, ro0, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro0, fo, fs, log, boolvar4; ri); boolvar1 := false; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); if boolvar1 then buf-opt := some(nd.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, m0, 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err0, 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) ∧ err = err0)), fs[ri[inodekey(m)]].directory, m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ri-cons(ri, fs); (ss)% ⊦ truncnode(key, m).key = key; (s)% ⊦ node-cons(key0, truncnode(key1, n)) ↔ key0.inode?; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ inodekey(0) ∈ ri; (s)