[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 inv-add-log-leb (previous step)

# buf = EB_PAGE_SIZE, # lpt = # avol, m0 = m3, ebm-vol-inv(avol), bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], false), bleb = buffered(m3) ∨ (bleb = nobuffer ∨ m2 = 0) ∧ m3 < # avol ∧ avol[m3].mapped? ∧ m4 = # avol[m3].data ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then plog := plog + m0; rofs := false; wbuf := mkwbuf(buf, m1, m2); if err = ESUCCESS then wbuf_move_buf#(m3, m4, rofs, avol; bleb, wbuf; err)⟫ (# wbuf.content = EB_PAGE_SIZE ∧ (bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(wbuf, avol[bleb.leb], rofs)))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 11:
# lpt = # avol, # buf = EB_PAGE_SIZE, m0 = m3, ebm-vol-inv(avol), bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], false), bleb = buffered(m3) ∨ (bleb = nobuffer ∨ m2 = 0) ∧ m3 < # avol ∧ avol[m3].mapped? ∧ m4 = # avol[m3].data ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then plog := plog + m0; rofs := false; wbuf := mkwbuf(buf, m1, m2); if err = ESUCCESS then wbuf_move_buf#(m3, m4, rofs, avol; bleb, wbuf; err)⟫ (# wbuf.content = EB_PAGE_SIZE ∧ (bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(wbuf, avol[bleb.leb], rofs)))

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};