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

# buf-opt0.buf = VFS_PAGE_SIZE, 0 = fs0[ri[inodekey(m)]].nsubdirs, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri[inodekey(m)]].nlink, 0, n)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], m0 = fs0[ri[inodekey(m)]].nlink, ro = orphans(fs0, ri), m2 % VFS_PAGE_SIZE ≠ 0, adr1 ≠ adr3, adr1 ≠ adr2, adr2 ≠ adr3, orphans(fs0, ri).inodes?, fo.inodes?, buf-opt0.some?, 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, m2 ≤ n, ¬ fs0[ri[inodekey(m)]].directory, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr3 ∈ fs0, asynced → boolvar0 ⊦ [aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr3, fi, orphans(fs0, ri), fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar4; ri); pageno0 := m2 % VFS_PAGE_SIZE; nd0 := inodenode(inodekey(m), md, false, m0, 0, n); buf-opt := buf-opt0; boolvar3 := boolvar2; inode := mkinode(m, md, false, m0, 0, m2); log := ((log0 + adr1 ') + adr2 ') + adr3 '; err := ESUCCESS; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr2, fi, ro, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro, fo, fs, log, boolvar4; ri); boolvar3 := true; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); nd := datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf-opt.buf); if boolvar3 then buf-opt := some((nd.data:= fill(nd.data, zero, pageno0, VFS_PAGE_SIZE - pageno0)).data)}] ( ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ 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(ro) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar3 ↔ boolvar2) ∧ err = err0))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 41:
# buf-opt0.buf = VFS_PAGE_SIZE, boolvar ↔ boolvar4, 0 = fs0[ri[inodekey(m)]].nsubdirs, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, adr = adr3, dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri[inodekey(m)]].nlink, 0, n)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], key = datakey(m, m2 / VFS_PAGE_SIZE), log = ((log0 + adr1 ') + adr2 ') + adr3 ', m0 = fs0[ri[inodekey(m)]].nlink, ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), fo.inodes?, orphans(fs0, ri).inodes?, buf-opt0.some?, 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), inodekey(m) ∈ ri, m2 ≤ n, asynced → boolvar0 ⊦ [if ¬ adr ∈ ri ∧ adr ∈ fs ∧ key-cons(key, fs[adr]) then ri[key] := adr else abort; pageno0 := m2 % VFS_PAGE_SIZE; nd0 := inodenode(inodekey(m), md, false, m0, 0, n); buf-opt := buf-opt0; boolvar3 := boolvar2; inode := mkinode(m, md, false, m0, 0, m2); log := ((log0 + adr1 ') + adr2 ') + adr3 '; err := ESUCCESS; 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); boolvar3 := true; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); nd := datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf-opt.buf); if boolvar3 then buf-opt := some((nd.data:= fill(nd.data, zero, pageno0, VFS_PAGE_SIZE - pageno0)).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 ∧ (boolvar3 ↔ boolvar2) ∧ err = err0)), m2 % VFS_PAGE_SIZE = 0, VFS_PAGE_SIZE = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, fs0[ri[inodekey(m)]].directory, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_store#(KEY, ADR, FI, RO, FO, FS, LOG, CSYNCED; RI) {if ¬ ADR ∈ RI ∧ ADR ∈ FS ∧ key-cons(KEY, FS[ADR]) then RI[KEY] := ADR else abort };