Proof step 14 from proof inv-rename-file-dentry (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 15:

  new_child_inode = mkinode(dirs[m].entries[str], md, false, files[dirs[m].entries[str]].nlink, 0, m2), new_dent = mkdentry(str, dirs[m].entries[str]), new_parent_inode = mkinode(m, md1, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size), old_child_inode = mkinode(dirs[m0].entries[str0], md0, false, files[dirs[m0].entries[str0]].nlink, 0, m3), old_dent = mkdentry(str0, dirs[m0].entries[str0]), old_parent_inode = mkinode(m0, md2, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size), afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), str ∈ dirs[m].entries, str0 ∈ dirs[m0].entries, m ∈ dirs, m0 ∈ dirs, dirs[m].entries[str] ∈ files, dirs[m0].entries[str0] ∈ files, m = m0 → md1 = md2, asynced → synced(files, icache, pcache), links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟪cache_rename# (; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files, icache, dcache, asynced0)⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ afs-cons(dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced → synced(files, icache, pcache)))

Rule argument

Additional information