[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 11 from proof synced-add-log-leb (previous step)

⟨if m1 < # avol ∧ avol[m1].mapped? ∧ m0 = # avol[m1].data ∧ synced(avol) then {fail_or_success#(; ; err); if err = ESUCCESS then nx := nx + m1, bleb := buffered(m1)} else abort⟩ (nx = nx1 ∧ bleb = bleb0 ∧ err = err1), # lpt = # avol, avol[m3] = mapped(buf), m = m2, m0 = # avol[m3].data, m1 = m3, avol[m3].mapped?, m3 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then nx := nx + m3 ', bleb := buffered(m3)⟩ (nx1 = nx), nx1 = nx

Heuristic symbolic execution applied rule if positive left

And obtained the following new goals

Proof step 12:
⟨fail_or_success#(; ; err); if err = ESUCCESS then nx := nx + m1, bleb := buffered(m1)⟩ (nx = nx1 ∧ bleb = bleb0 ∧ err = err1), # lpt = # avol, avol[m3] = mapped(buf), m = m2, m0 = # avol[m3].data, m1 = m3, avol[m3].mapped?, m3 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then nx := nx + m3 ', bleb := buffered(m3)⟩ (nx1 = nx), nx1 = nx

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ mapped(buf).mapped?; (s)