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

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

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

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

Rule argument

spec: inode name: elim seq: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2) subst: [inode, m, md, boolvar, m0, m1, m2] → [parent_inode, m0, md0, boolvar0, m4, m5, m6]

Additional information

Used simplifier rules: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2); (elim) Used terms: parent_inode, m0, md0, boolvar0, m4, m5, m6