[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 26 from proof crash-neutral-unlink (previous step)

c_inode.ino = entries0[str], c_inode.nlink = files[entries0[str]].nlink, c_inode.nsubdirs = 0, dirs0[m] = mkdir(m1 + 1, md1, # links(m, dirs0), m2, entries0), dirs = dirs0[m, mkdir(m1, md1, # links(m, dirs0), m2, entries0 -- str)], files0 = files, ino = entries0[str], afs-cons(dirs0, files), m ∈ dirs0, entries0[str] ∈ files, str ∈ entries0, ¬ c_inode.directory, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨fail#(; ; err); asynced := ?⟩ asynced, ⟨if ino ∈ dirs0 then dirs[ino].nlink := dirs[ino].nlink - 1; if ino ∈ files then files[ino].nlink := files[ino].nlink - 1; dent := negdentry(mkdentry(str, entries0[str]).name); afs_inode_sync#(mkinode(m, md, true, # links(m, dirs0), m2, m1 + 1); dirs, files); afs_inode_sync#(c_inode; dirs, files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := (c_inode.ino ∈ dirs ⊃ mkinode(c_inode.ino, dirs[c_inode.ino].meta, true, dirs[c_inode.ino].nlink, dirs[c_inode.ino].nsubdirs, dirs[c_inode.ino].size) ;mkinode(c_inode.ino, files[c_inode.ino].meta, false, files[c_inode.ino].nlink, 0, files[c_inode.ino].size) ); err := ESUCCESS; asynced := ?⟩ (asynced ∧ dirs0 \ orphans(dirs0, files0) = dirs \ orphans(dirs, files) ∧ files0 \ orphans(dirs0, files0) = files \ orphans(dirs, files))

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 27:
c_inode.ino = entries0[str], c_inode.nlink = files[entries0[str]].nlink, c_inode.nsubdirs = 0, dirs0[m] = mkdir(m1 + 1, md1, # links(m, dirs0), m2, entries0), dirs = dirs0[m, mkdir(m1, md1, # links(m, dirs0), m2, entries0 -- str)], files0 = files, ino = entries0[str], afs-cons(dirs0, files), str ∈ entries0, entries0[str] ∈ files, m ∈ dirs0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨skip; if ino ∈ files then files[ino].nlink := files[ino].nlink - 1; dent := negdentry(mkdentry(str, entries0[str]).name); afs_inode_sync#(mkinode(m, md, true, # links(m, dirs0), m2, m1 + 1); dirs, files); afs_inode_sync#(c_inode; dirs, files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := (c_inode.ino ∈ dirs ⊃ mkinode(c_inode.ino, dirs[c_inode.ino].meta, true, dirs[c_inode.ino].nlink, dirs[c_inode.ino].nsubdirs, dirs[c_inode.ino].size) ;mkinode(c_inode.ino, files[c_inode.ino].meta, false, files[c_inode.ino].nlink, 0, files[c_inode.ino].size) ); err := ESUCCESS; asynced := ?⟩ (asynced ∧ dirs0 \ orphans(dirs0, files0) = dirs \ orphans(dirs, files) ∧ files0 \ orphans(dirs0, files0) = files \ orphans(dirs, files)), ⟨fail#(; ; err); asynced := ?⟩ asynced, c_inode.directory

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)