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

fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = 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), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), m2 % VFS_PAGE_SIZE ≠ 0, fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, m2 ≤ n, ¬ fs[ri[inodekey(m)]].directory, ¬ buf-opt.some? ⊦ ⟪aubifs_core_journal_add3#(truncnode(inodekey(m), m2), nd0, nd, ri, fi, ro, fo; adr1, adr0, adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar0; ri); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := true; 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, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 282:
fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, adr4 = adr1, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = 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), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), nd1 = truncnode(inodekey(m), m2), fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, m2 ≤ n ⊦ ⟪if ri-cons(ri, fs) ∧ node-cons(nd1.key, nd1) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {adr4 := adr1, adr0 := adr2, adr := adr3; fs := fs[adr4, nd1][adr0, nd0][adr, nd], log := ((log + adr4) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?}; boolvar := ?} else abort; boolvar0 := boolvar; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar0; ri); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := true; 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, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), m2 % VFS_PAGE_SIZE = 0, fs[ri[inodekey(m)]].directory, buf-opt.some?

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_journal_add3# (ND1, ND2, ND3, RI, FI, RO, FO ; ADR1, ADR2, ADR3, FS, LOG ; CSYNCED, ERR ) {if ri-cons(RI, FS) ∧ node-cons(ND1.key, ND1) ∧ node-cons(ND2.key, ND2) ∧ node-cons(ND3.key, ND3) then { choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), FS) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {ADR1 := adr1, ADR2 := adr2, ADR3 := adr3; FS := FS[ADR1, ND1][ADR2, ND2][ADR3, ND3], LOG := ((LOG + ADR1) + ADR2) + ADR3, ERR := ESUCCESS} ifnone ERR := ENOSPC or {fail#(; ; ERR); ADR1 := ?, ADR2 := ?, ADR3 := ?}; CSYNCED := ?} else abort };