[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 274 from proof inv-link (previous step)

dirs[ino0] = mkdir(m0, md0, # links(ino0, dirs), m3, entries0), c_inode = inode, err = err0, inode = mkinode(ino0, md0, true, # links(ino0, dirs), m3, m0), afs-cons(dirs, files), ispath(q, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), ino0 ∈ dirs, str ∈ entries0, ⌊err0⌋ , links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO, entries0[str] ∈ dirs ∨ entries0[str] ∈ files ⊦ ⟪if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then afs_link#(mkdentry(str, entries0[str]); new_inode, c_inode, new_dent, err, dirs, files; asynced)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), p = ε

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 275:
dirs[ino0] = mkdir(m0, md0, # links(ino0, dirs), m3, entries0), c_inode = inode, err = err0, inode = mkinode(ino0, md0, true, # links(ino0, dirs), m3, m0), afs-cons(dirs, files), ispath(q, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), str ∈ entries0, ino0 ∈ dirs, ⌊err0⌋ , entries0[str] ∈ dirs ∨ entries0[str] ∈ files, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO ⊦ ⟪skip; if err = ESUCCESS then afs_link#(mkdentry(str, entries0[str]); new_inode, c_inode, new_dent, err, dirs, files; asynced)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), p = ε

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)