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

fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, boolvar, err = ESUCCESS, 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)]], nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), 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), datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, m2 ≤ n ⊦ ⟪nd.data := fill (nd.data, zero, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE, VFS_PAGE_SIZE - mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE); aubifs_core_journal_add3#(truncnode(inodekey(m), min(n, 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 := 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, 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?

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 278:
fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, boolvar, err = ESUCCESS, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = nd1 .data:= fill (nd1.data, zero, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE, VFS_PAGE_SIZE - mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), nd1 = fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]], nd1.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, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE + (VFS_PAGE_SIZE - mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE) ≤ # nd1.data, VFS_PAGE_SIZE ≥ mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE ⊦ ⟪aubifs_core_journal_add3#(truncnode(inodekey(m), min(n, 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 := 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, 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, VFS_PAGE_SIZE = 0, fs[ri[inodekey(m)]].directory, buf-opt.some?

Rule argument

Additional information

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