Proof step 11 from proof refine-rename-overwrite-keep-parent-identity (previous step)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

• Proof step 12:

  new_inode.nlink = fs[ri[inodekey(new_inode.ino)]].nlink, new_inode.nsubdirs = fs[ri[inodekey(new_inode.ino)]].nsubdirs, new_inode.size = fs[ri[inodekey(new_inode.ino)]].size, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(new_inode.ino, str)]].ino, new_child_inode = mkinode(m, md, boolvar1, m0, m1, m2), new_dent = mkdentry(str, m), old_dent = mkdentry(str, m), old_dent_inode = mkinode(m, md0, boolvar2, m3, m4, m5), old_parent_inode = mkinode(new_inode.ino, new_inode.meta, true, new_inode.nlink, new_inode.nsubdirs, new_inode.size), ro = orphans(fs, ri), new_inode.directory, fs[ri[inodekey(new_inode.ino)]].directory, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(new_inode.ino) ∈ ri, inodekey(m) ∈ ri, dentrykey(new_inode.ino, str) ∈ ri, 1 ≤ new_inode.size, boolvar2 → 1 ≤ new_inode.nsubdirs, m0 = 1 → links(m, fs, ri) = ∅ ++ dentrykey(new_inode.ino, str), boolvar → boolvar0, fs[ri[inodekey(m)]].directory → abs-children(m, fs, ri) = ∅, fs[ri[inodekey(m)]].directory → dentrykeys(inodekey(m), ri) = ∅, new_inode.nlink ≠ 0 ∨ new_inode.ino = ROOT_INO, links(new_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_inode.ino = ROOT_INO, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m4 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar2 ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m4 = fs[ri[inodekey(m)]].nsubdirs ∧ m5 = fs[ri[inodekey(m)]].size, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(m)]].directory ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m5 = fs[ri[inodekey(m)]].size ∧ m4 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m3 = fs[ri[inodekey(m)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1 ⊦ ⟪aubifs_rename_overwrite_keep_parent# (boolvar2, old_dent_inode, fi, fo; old_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar0); new_parent_inode := old_parent_inode⟫ ⟨old_dent2 := mkdentry(str, m); old_dent_inode0 := old_dent_inode; old_dent1 := mkdentry(str, m); new_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); old_inode := mkinode(new_inode.ino, new_inode.meta, true, new_inode.nlink, new_inode.nsubdirs, new_inode.size); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent1, old_dent2, err0, dirs, files; boolvar)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (boolvar → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent1 ∧ new_dent = old_dent2 ∧ err = err0), new_inode.size = 0, m = ROOT_INO, m0 = 0, new_inode.nlink = 0 ∧ new_inode.ino ≠ ROOT_INO

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_dent_inode, m, md0, boolvar2, m3, m4, m5