Proof step 21 from proof inv-rename-dir-negdentry (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

• Proof step 22:

  asynced0 ↔ new_dent.dentry?, asynced1 ↔ asynced2, dirs[m] = mkdir(m4, md4, # links(m, dirs), m7, entries1), dirs[m0] = mkdir(m1, md2, # links(m0, dirs), m3, entries), dirs[entries1[str]] = mkdir(m2, md3, # links(entries1[str], dirs), m5, entries0), new_dent = negdentry(str0), new_parent_inode = mkinode(m0, md1, true, # links(m0, dirs), m3, m1), old_child_inode = mkinode(entries1[str], md, true, # links(entries1[str], dirs), m5, m2), old_dent = mkdentry(str, entries1[str]), old_parent_inode = mkinode(m, md0, true, # links(m, dirs), m7, m4), afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files), synced(dirs, icache, pcache), str ∈ entries1, entries1[str] ∈ dirs, m ∈ dirs, m0 ∈ dirs, m0 = m → md1 = md0, asynced → synced(files, icache, pcache), links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟪afs_rename#(; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files; asynced1); if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, icache); icache_set#(new_parent_inode, asynced; err, icache); if asynced0 then icache_set#(new_child_inode, asynced; err, icache); dcache_delete#(old_parent_inode.ino, old_dent.name; err, dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, dcache)}⟫ ( 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))), str0 ∈ entries

Rule argument

Additional information