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

VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs[ri[inodekey(m)]] = inodenode(key, md0, false, m3, 0, m5), adr4 = adr1, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), 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 = fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]], ro = orphans(fs, ri), ro0 = orphans(fs, ri), nd2.data?, fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, 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), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, m2 % VFS_PAGE_SIZE + n0 ≤ # nd2.data, m2 ≤ n, asynced → boolvar4 ⊦ [fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; m1 := m; err0 := err, boolvar4 := boolvar; 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?

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 793:
VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs[ri[inodekey(m)]] = inodenode(key, md0, false, m3, 0, m5), m2 % VFS_PAGE_SIZE ≠ 0, m ≠ 0, fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, 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), node-cons ((fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0)).key, fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0)), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, m2 ≤ n, ¬ buf-opt0.some?, asynced → boolvar4 ⊦ [fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; m1 := m; err0 := err, boolvar4 := boolvar; ro0 := orphans(fs, ri); nd2 := fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]]; files := abs-files(fs, ri); dirs := abs-dirs(fs, ri); 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) → ⟨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))

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ m ≤ m; (s)%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ inodekey(m).ino = m; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ node-cons(key0, truncnode(key1, n)) ↔ key0.inode?; (s)% ⊦ truncnode(key, m).key = key; (s)%⊦ datakey(m, n) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → # fs[ri[datakey(m, n)]].data = VFS_PAGE_SIZE; (s)% ⊦ VFS_PAGE_SIZE ≠ 0; (s)