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

⟨if err2 = ESUCCESS then nx := nx + m1, bleb := buffered(m1)⟩ (nx = nx1 ∧ bleb = bleb0 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # 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 conditional left split applied rule if left

And obtained the following new goals

Proof step 14:
⟨nx := nx + m1, bleb := buffered(m1)⟩ (nx = nx1 ∧ bleb = bleb0 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # lpt = # avol, avol[m3] = mapped(buf), err2 = ESUCCESS, 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
Proof step 25:
⟨skip⟩ (nx = nx1 ∧ bleb = bleb0 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # 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), err2 = ESUCCESS, nx1 = nx

Rule argument

pos: left 1

Proof step 13 from proof synced-add-log-leb (previous step)

Heuristic conditional left split applied rule if left

And obtained the following new goals

Rule argument

Additional information