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

0 = fs[ri[inodekey(m)]].nsubdirs, err = err0, fs[ri[inodekey(m)]].inode?, 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, ri[inodekey(m)] ∈ fs, m2 ≤ n, asynced → boolvar4, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [if err = ESUCCESS then {boolvar := datakey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).ino, m2 / VFS_PAGE_SIZE) ∈ ri; if boolvar then nd := fs[ri[datakey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).ino, m2 / VFS_PAGE_SIZE)]] else nd := ?} else boolvar := ?, nd := ?; ro0 := orphans(fs, ri); ro := orphans(fs, ri); nd0 := inodenode (inodekey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).ino), mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).meta, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).directory, fs[ri[inodekey(m)]].nlink, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).nsubdirs, n); m0 := fs[ri[inodekey(m)]].nlink; key1 := inodekey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2).ino); inode := mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, 0, m2); files := abs-files(fs, ri); dirs := abs-dirs(fs, ri); if err = ESUCCESS then if boolvar then {nd.data := fill(nd.data, zero, inode.size % VFS_PAGE_SIZE, VFS_PAGE_SIZE - inode.size % VFS_PAGE_SIZE); aubifs_core_journal_add3#(truncnode(key1, min(n, inode.size)), nd0, nd, ri, fi, ro, fo; adr1, adr0, adr, fs, log; boolvar4, err); if err = ESUCCESS then aubifs_core_index_store#(datakey(inode.ino, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar4; ri)} else aubifs_core_journal_add2#(truncnode(key1, min(n, inode.size)), nd0, ri, fi, ro, fo; adr1, adr0, fs, log; boolvar4, err); buf-opt := buf-opt0; boolvar1 := boolvar2; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(inode.ino), adr0, fi, ro, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(key1, min(n, inode.size), fi, ro, fo, fs, log, boolvar4; ri); boolvar1 := boolvar; 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, 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) ∧ err = err1)), m2 % VFS_PAGE_SIZE = 0, fs[ri[inodekey(m)]].directory, buf-opt0.some?

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information