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

⟨awbuf_remap#(m2, adr, m1, nx, lpt, ns, bleb, isbuf; avol; err)⟩ (avol = avol1 ∧ err = err1), # lpt = # avol, buffered(m2) ≠ bleb, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol1, ¬ avol0 ↓ avol ⊦ ∃ 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)

Heuristic nonrecursive calls applied rule call left

And obtained the following new goals

Proof step 11:
⟨if synced(avol) ∧ m0 < # avol ∧ buffered(m0) ≠ bleb then {fail_or_success#(; ; err); if err = ESUCCESS then avol[m0] := mapped(mkbuf(0)) else {skip or avol[m0] := unmapped}} else abort⟩ (avol = avol1 ∧ err = err1), # 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, avol0 ↓ avol

Rule argument

pos: left 1

Additional information

Used simplifier rules: remap: ⊦ ;