[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 24 from proof inv-rename-new-keep-parent (previous step)

fs[ri[dentrykey(m, str)]] = dentrynode(key, m0), m4 = fs[ri[inodekey(m)]].nlink, m5 = fs[ri[inodekey(m)]].nsubdirs, m6 = fs[ri[inodekey(m)]].size, old_dent = mkdentry(str, m0), fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m)]].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(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].size, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ fs[ri[inodekey(m0)]].directory ∧ ¬ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∨ fs[ri[inodekey(m0)]].directory ∧ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∧ m3 = fs[ri[inodekey(m0)]].size ⊦ ⟪aubifs_core_journal_add3# (dentrynode(dentrykey(m, old_dent.name), 0), dentrynode(dentrykey(m, str0), old_dent.ino), inodenode(inodekey(m), md, true, m4, m5, m6), ri, fi, ro, fo ; adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, old_dent.name), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, old_dent.ino); old_dent := negdentry(old_dent.name); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m4, m5, m6).meta, inodenode(inodekey(m), md, true, m4, m5, m6).directory, inodenode(inodekey(m), md, true, m4, m5, m6).nlink, inodenode(inodekey(m), md, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m), md, true, m4, m5, m6).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)), fs[ri[inodekey(m)]].size = 0, dentrykey(m, str0) ∈ ri, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 25:
fs[ri[dentrykey(m, str)]] = dentrynode(key, m0), m4 = fs[ri[inodekey(m)]].nlink, m5 = fs[ri[inodekey(m)]].nsubdirs, m6 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(m)]].size ≠ 0, fs[ri[inodekey(m)]].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(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].size, ¬ dentrykey(m, str0) ∈ ri, ¬ inodekey(m) ∈ ro, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ fs[ri[inodekey(m0)]].directory ∧ ¬ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∨ fs[ri[inodekey(m0)]].directory ∧ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∧ m3 = fs[ri[inodekey(m0)]].size ⊦ ⟪aubifs_core_journal_add3# (dentrynode(dentrykey(m, str), 0), dentrynode(dentrykey(m, str0), mkdentry(str, m0).ino), inodenode(inodekey(m), md, true, m4, m5, m6), ri, fi, ro, fo ; 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(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m0).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m4, m5, m6).meta, inodenode(inodekey(m), md, true, m4, m5, m6).directory, inodenode(inodekey(m), md, true, m4, m5, m6).nlink, inodenode(inodekey(m), md, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m), md, true, m4, m5, m6).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)% ⊦ dentrynode(key, m).dentry?; (s)% ⊦ mkdentry(str, m).name = str; (s)