| # lpt2 = # avol1, # buf = EB_PAGE_SIZE, rofs ↔ rofs0, adr0 = adr1, avol = avol0, bleb = bleb0, lpt = lpt2, lpt0 = lpt1, m0 = m1, m1 = m2, m6 = m3, ns0 = ns1, wbuf = wbuf0, ebm-vol-inv(avol1), avol1 ⊆ avol0, bleb1 ≠ nobuffer → bleb1.leb < # avol1 ∧ wbuf-cons(mkwbuf(buf, m5, m4), avol1[bleb1.leb], rofs1) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then adr0 := adr, m0 := m, log := plog, lpt0 := lpt, ns0 := ns else avol := ?, adr := ?, m := ?, plog := ?, lpt := ?, adr0 := ?, m0 := ?, log := ?, lpt0 := ?, ns0 := ?, ns := ?; if err = ESUCCESS then {apersistence_io_get_page_size#(adr, m, plog, avol, lpt, ns; ; m6); bleb := nobuffer; wbuf.content := mkbuf(m6); rofs := false}⟫ ( err = ESUCCESS → # wbuf.content = EB_PAGE_SIZE ∧ (bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(wbuf, avol[bleb.leb], rofs)) ∧ m6 = EB_PAGE_SIZE ∧ ebm-vol-inv(avol) ∧ # lpt = # avol) |
# buf = EB_PAGE_SIZE, # lpt2 = # avol1, rofs ↔ rofs0, adr0 = adr1, avol = avol0, bleb = bleb0, lpt = lpt2, lpt0 = lpt1, m0 = m1, m1 = m2, m6 = m3, ns0 = ns1, wbuf = wbuf0, ebm-vol-inv(avol1), avol1 ⊆ avol0, bleb1 ≠ nobuffer → bleb1.leb < # avol1 ∧ wbuf-cons(mkwbuf(buf, m5, m4), avol1[bleb1.leb], rofs1) ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then adr0 := adr, m0 := m, log := plog, lpt0 := lpt, ns0 := ns else avol := ?, adr := ?, m := ?, plog := ?, lpt := ?, adr0 := ?, m0 := ?, log := ?, lpt0 := ?, ns0 := ?, ns := ?; if err = ESUCCESS then {apersistence_io_get_page_size#(adr, m, plog, avol, lpt, ns; ; m6); bleb := nobuffer; wbuf.content := mkbuf(m6); rofs := false}⟫ ( err = ESUCCESS → # wbuf.content = EB_PAGE_SIZE ∧ (bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(wbuf, avol[bleb.leb], rofs)) ∧ m6 = EB_PAGE_SIZE ∧ ebm-vol-inv(avol) ∧ # lpt = # avol)
Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};