[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 46 from proof initialization (previous step)

err = err0, ⌊err0⌋ ⊦ ⟪if err = ESUCCESS then dcache_format#(; ; dcache, err); if err = ESUCCESS then pcache_format#(; ; pcache, err)⟫ ( ( err = ESUCCESS → ⟨afs_format#(n, asynced2, LEB_SIZE, md; afs_dirs; afs_files, afs_asynced, err1)⟩ (afs_dirs = dirs ∧ afs_files = (files ⊕ pcache) ⊕ icache ∧ (afs_asynced ↔ asynced) ∧ ESUCCESS = err1)) ∧ ( err ≠ ESUCCESS → (∀ dirs, files, asynced. ⟨afs_format#(n, asynced2, LEB_SIZE, md; afs_dirs; afs_files, afs_asynced, err1)⟩ (dirs = afs_dirs ∧ files = afs_files ∧ (asynced ↔ afs_asynced) ∧ err = err1))))

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 47:
err = err0, ⌊err0⌋ ⊦ ⟪skip; if err = ESUCCESS then pcache_format#(; ; pcache, err)⟫ ( ( err = ESUCCESS → ⟨afs_format#(n, asynced2, LEB_SIZE, md; afs_dirs; afs_files, afs_asynced, err1)⟩ (afs_dirs = dirs ∧ afs_files = (files ⊕ pcache) ⊕ icache ∧ (afs_asynced ↔ asynced) ∧ ESUCCESS = err1)) ∧ ( err ≠ ESUCCESS → (∀ dirs, files, asynced. ⟨afs_format#(n, asynced2, LEB_SIZE, md; afs_dirs; afs_files, afs_asynced, err1)⟩ (dirs = afs_dirs ∧ files = afs_files ∧ (asynced ↔ afs_asynced) ∧ err = err1))))

Rule argument

Additional information

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