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

# lpt = # avol, # buf = EB_PAGE_SIZE, buffered(m4) ≠ bleb, m4 < # avol, ebm-vol-inv(avol), bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs) ⊦ [apersistence_io_remap#(m4, adr, m, plog, lpt, ns; avol; err)] (ebm-vol-inv(avol) ∧ # lpt = # avol → bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs))

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 12:
# buf = EB_PAGE_SIZE, # lpt = # avol, m0 = m4, m4 < # avol, ebm-vol-inv(avol), bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs) ⊦ [if m0 < # avol then {fail_or_success#(; ; err); if err = ESUCCESS then avol[m0] := mapped(mkbuf(0)) else {skip or avol[m0] := unmapped}} else abort] (ebm-vol-inv(avol) ∧ # lpt = # avol → bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs)), buffered(m4) = bleb

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_io_remap# (LNUM, PROOTADR, PMAXINO, PLOG, PLPT, PORPHANS; PVOL; ERR) {if LNUM < # PVOL then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then PVOL[LNUM] := mapped(mkbuf(0)) else {skip or PVOL[LNUM] := unmapped}} else abort };