[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 16 from proof refine-unlink (previous step)

err0 = EACCESS, fs = abs-files(files), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), psynced → asynced ⊦ ⟨if err0 = ESUCCESS then let fid = root.fid in {root := root -- ε; if ¬ fid ∈ abs-of(of).fids ∧ ¬ fid ∈ root.fids then fs := fs -- fid}; psynced := ?⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EACCESS = err0)

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 17:
err0 = EACCESS, fs = abs-files(files), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), psynced → asynced ⊦ ⟨skip; psynced := ?⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EACCESS = err0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ESUCCESS ≠ EACCESS; (s)