[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 25 from proof synced-remap (previous step)

⟨skip or avol[m0] := unmapped⟩ (avol = avol1 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # lpt = # avol, m = m1, m0 = m2, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol1 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avol[m2] := mapped(mkbuf(0)) else {skip or avol[m2] := unmapped}⟩ (synced(avol) ∧ avol0 ↓ avol), buffered(m2) = bleb, err2 = ESUCCESS, avol0 ↓ avol

Heuristic conditional left split applied rule or split left

And obtained the following new goals

Proof step 26:
⟨skip⟩ (avol = avol1 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # lpt = # avol, m = m1, m0 = m2, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol1 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avol[m2] := mapped(mkbuf(0)) else {skip or avol[m2] := unmapped}⟩ (synced(avol) ∧ avol0 ↓ avol), buffered(m2) = bleb, err2 = ESUCCESS, avol0 ↓ avol
Proof step 27:
⟨avol[m0] := unmapped⟩ (avol = avol1 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # lpt = # avol, m = m1, m0 = m2, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol1 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avol[m2] := mapped(mkbuf(0)) else {skip or avol[m2] := unmapped}⟩ (synced(avol) ∧ avol0 ↓ avol), buffered(m2) = bleb, err2 = ESUCCESS, avol0 ↓ avol

Proof step 25 from proof synced-remap (previous step)

Heuristic conditional left split applied rule or split left

And obtained the following new goals

Rule argument

Additional information