Proof step 5 from proof inv-renam (previous step)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

• Proof step 6:

  fs[ri[dentrykey(m, str)]].ino = old_child_inode.ino, new_parent_inode.nlink = fs[ri[inodekey(new_parent_inode.ino)]].nlink, new_parent_inode.nsubdirs = fs[ri[inodekey(new_parent_inode.ino)]].nsubdirs, new_parent_inode.size = fs[ri[inodekey(new_parent_inode.ino)]].size, boolvar0, m0 = fs[ri[inodekey(m)]].nlink, m1 = fs[ri[inodekey(m)]].nsubdirs, m2 = fs[ri[inodekey(m)]].size, old_dent = mkdentry(str, old_child_inode.ino), old_parent_inode = mkinode(m, md, boolvar0, m0, m1, m2), fs[ri[inodekey(m)]].directory, fs[ri[inodekey(new_parent_inode.ino)]].directory, new_parent_inode.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), inodekey(m) ∈ ri, inodekey(old_child_inode.ino) ∈ ri, dentrykey(m, str) ∈ ri, inodekey(new_parent_inode.ino) ∈ ri, 1 ≤ m2, new_parent_inode.ino = m → new_parent_inode.meta = md, old_child_inode.directory → 1 ≤ m1, ¬ fs[ri[inodekey(old_child_inode.ino)]].directory ∧ ¬ old_child_inode.directory ∧ old_child_inode.nlink = fs[ri[inodekey(old_child_inode.ino)]].nlink ∧ old_child_inode.nsubdirs = fs[ri[inodekey(old_child_inode.ino)]].nsubdirs ∨ fs[ri[inodekey(old_child_inode.ino)]].directory ∧ old_child_inode.directory ∧ old_child_inode.nlink = fs[ri[inodekey(old_child_inode.ino)]].nlink ∧ old_child_inode.nsubdirs = fs[ri[inodekey(old_child_inode.ino)]].nsubdirs ∧ old_child_inode.size = fs[ri[inodekey(old_child_inode.ino)]].size, new_dent.negdentry? ∧ (new_parent_inode.nlink ≠ 0 ∨ new_parent_inode.ino = ROOT_INO) ∧ ¬ inodekey(new_parent_inode.ino) ∈ ro ∧ ¬ dentrykey(new_parent_inode.ino, new_dent.name) ∈ ri ∨ new_dent.dentry? ∧ (new_parent_inode.nlink ≠ 0 ∨ new_parent_inode.ino = ROOT_INO) ∧ ¬ inodekey(new_parent_inode.ino) ∈ ro ∧ inodekey(new_dent.ino) ∈ ri ∧ dentrykey(new_parent_inode.ino, new_dent.name) ∈ ri ∧ fs[ri[dentrykey(new_parent_inode.ino, new_dent.name)]].ino = new_dent.ino ∧ ( inodekey(new_child_inode.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_child_inode.ino)]].directory ∧ ¬ new_child_inode.directory ∧ new_child_inode.nlink = fs[ri[inodekey(new_child_inode.ino)]].nlink ∧ new_child_inode.nsubdirs = fs[ri[inodekey(new_child_inode.ino)]].nsubdirs ∨ inodekey(new_child_inode.ino) ∈ ri ∧ fs[ri[inodekey(new_child_inode.ino)]].directory ∧ new_child_inode.directory ∧ new_child_inode.nlink = fs[ri[inodekey(new_child_inode.ino)]].nlink ∧ new_child_inode.nsubdirs = fs[ri[inodekey(new_child_inode.ino)]].nsubdirs ∧ new_child_inode.size = fs[ri[inodekey(new_child_inode.ino)]].size) ∧ new_child_inode.ino = new_dent.ino ∧ (¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(old_child_inode.ino)]].directory) ∧ (fs[ri[inodekey(new_dent.ino)]].directory → new_dent.ino ≠ ROOT_INO ∧ dentrykeys(inodekey(new_dent.ino), ri) = ∅) ∧ new_child_inode.ino ≠ ROOT_INO ∧ new_child_inode.nlink ≠ 0 ∧ (new_child_inode.nlink = 1 → links(new_child_inode.ino, fs, ri) = ∅ ++ dentrykey(new_parent_inode.ino, new_dent.name)), m0 ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_rename#(fi, fo; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar)⟫ (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 = 0, inodekey(m) ∈ ro

Rule argument

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: old_parent_inode, m, md, boolvar0, m0, m1, m2