[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 inv-rename-new-reparent (previous step)

m1 + 1 = fs[ri[inodekey(m)]].size, n0 + (boolvar2 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, fs[ri[dentrykey(m, str)]] = dentrynode(key, m3), fs[ri[inodekey(m3)]] = inodenode(key0, md1, boolvar0, m5, m9, m10), m2 = fs[ri[inodekey(m)]].nlink, m6 = fs[ri[inodekey(m0)]].nlink, m7 = fs[ri[inodekey(m0)]].nsubdirs, m8 = fs[ri[inodekey(m0)]].size, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(m3)]].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-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), dentrykey(m, str) ∈ ri, inodekey(m3) ∈ ri, inodekey(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(m3)] ∈ fs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10 ⊦ ⟪aubifs_core_journal_add4# (dentrynode(dentrykey(m, str), 0), dentrynode(dentrykey(m0, str0), mkdentry(str, m3).ino), inodenode(inodekey(m), md, true, m2, n0, m1), inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1), ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m0, str0), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m3).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, n0, m1).meta, inodenode(inodekey(m), md, true, m2, n0, m1).directory, inodenode(inodekey(m), md, true, m2, n0, m1).nlink, inodenode(inodekey(m), md, true, m2, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m2, n0, m1).size); new_parent_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).meta, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).directory, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nlink, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nsubdirs, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).size)}⟫ (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)), m0 = m, inodekey(m0) ∈ ro, dentrykey(m0, str0) ∈ ri, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 41:
m1 + 1 = fs[ri[inodekey(m)]].size, n0 + (boolvar2 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, fs[ri[dentrykey(m, str)]] = dentrynode(key, m3), fs[ri[inodekey(m3)]] = inodenode(key0, md1, boolvar0, m5, m9, m10), m2 = fs[ri[inodekey(m)]].nlink, m6 = fs[ri[inodekey(m0)]].nlink, m7 = fs[ri[inodekey(m0)]].nsubdirs, m8 = fs[ri[inodekey(m0)]].size, m0 ≠ m, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m0)]].directory, 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-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), dentrykey(m, str) ∈ ri, inodekey(m3) ∈ ri, inodekey(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(m3)] ∈ fs, ¬ inodekey(m0) ∈ ro, ¬ dentrykey(m0, str0) ∈ ri, ¬ inodekey(m) ∈ ro, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10 ⊦ ⟪aubifs_core_journal_add4# (dentrynode(dentrykey(m, str), 0), dentrynode(dentrykey(m0, str0), mkdentry(str, m3).ino), inodenode(inodekey(m), md, true, m2, n0, m1), inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1), ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m0, str0), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m3).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, n0, m1).meta, inodenode(inodekey(m), md, true, m2, n0, m1).directory, inodenode(inodekey(m), md, true, m2, n0, m1).nlink, inodenode(inodekey(m), md, true, m2, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m2, n0, m1).size); new_parent_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).meta, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).directory, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nlink, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nsubdirs, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).size)}⟫ (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))

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)