Proof step 18 from proof inv-link (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

• Proof step 19:

  dirs[ino] = mkdir(m2, md3, # links(ino, dirs), m6, entries0), files[entries0[str]] = mkfile(m0, md1, # links(entries0[str], dirs), content), dirs[m] = mkdir(m1, md2, # links(m, dirs), m4, entries), c_inode = mkinode(entries0[str], md0, false, # links(entries0[str], dirs), 0, m3), new_dent = negdentry(str0), old_dent = mkdentry(str, entries0[str]), p_inode = mkinode(m, md, true, # links(m, dirs), m4, m1), afs-cons(dirs, files), pre-link(p_inode, c_inode, old_dent, new_dent, dirs, files), entries0[str] ∈ files, m ∈ dirs, str ∈ entries0, ino ∈ dirs, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO ⊦ ⟪let p_ino = p_inode.ino in {dirs[p_ino].entries[new_dent.name] := old_dent.ino; dirs[p_ino].size := dirs[p_ino].size + 1; let ino = old_dent.ino in afs_inc_nlink#(ino; dirs, files); new_dent := mkdentry(new_dent.name, old_dent.ino); afs_inode_sync#(p_inode; dirs, files); afs_inode_sync#(c_inode; dirs, files); p_inode := getinode(p_inode.ino, dirs, files); c_inode := getinode(old_dent.ino, dirs, files); err := ESUCCESS}; asynced := ?⟫ afs-cons(dirs, files), str0 ∈ entries

• Proof step 79:

  dirs[ino] = mkdir(m2, md3, # links(ino, dirs), m6, entries0), files[entries0[str]] = mkfile(m0, md1, # links(entries0[str], dirs), content), dirs[m] = mkdir(m1, md2, # links(m, dirs), m4, entries), c_inode = mkinode(entries0[str], md0, false, # links(entries0[str], dirs), 0, m3), new_dent = negdentry(str0), old_dent = mkdentry(str, entries0[str]), p_inode = mkinode(m, md, true, # links(m, dirs), m4, m1), afs-cons(dirs, files), pre-link(p_inode, c_inode, old_dent, new_dent, dirs, files), entries0[str] ∈ files, m ∈ dirs, str ∈ entries0, ino ∈ dirs, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO ⊦ ⟪fail#(; ; err); asynced := ?⟫ afs-cons(dirs, files), str0 ∈ entries

Rule argument

Additional information