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

# lpt = # avol, # buf = EB_PAGE_SIZE, 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 avol[m0] := unmapped else abort⟫ ((bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs)) ∧ ebm-vol-inv(avol) ∧ # lpt = # avol), buffered(m4) = bleb

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 10:
# 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) ⊦ ⟪avol[m0] := unmapped⟫ ((bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs)) ∧ ebm-vol-inv(avol) ∧ # lpt = # avol), buffered(m4) = bleb

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)