[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 13 from proof refine-get-iblock-refsize (previous step)

# lpt = # avol, # lpt0 = # avol, lpt[m] = mklp(m4, m5, LP_INDEX_NODES, m6), istore[m] = indexblock(indx, lax, m4), keyset(gch) = gc-heap(lpt, log0), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log0 ∩ ginval = ∅, dom gstore0 ∪ elems log0 = dom gstore ∪ ginval, ginval < # avol, m < # avol, abs-gstore(avol, lpt, gstore, ginval), abs-istore(avol, lpt, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(pstate = readonly, bleb, lpt, avol), bufs-log-only(bleb, log0, lpt), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), inv(indexblock(indx, lax, m4)), log-group-block(log0, lpt), lpt-free-unref(lpt), lpt-free-unref(lpt0), lpt-leb-size(lpt), lpt-leb-size(lpt0), lpt-ram-flash(lpt, lpt0, log0), m ∈ istore, istore0 ⊑ istore, ¬ dups(log0), isbuf → synced(avol), pstate = unbuffered → bleb = nobuffer, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum), pstate.journal? → log0 ≠ [] ∧ pstate.lnum = log0.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore, pstate = unbuffered → isbuf ⊦ ⟨apersistence_get_iblock_refsize#(m, adr0, istore, istore0, ginval, gstore, gstore0, log0, m0, ns0, pstate, isbuf; ; n0)⟩ ( (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ m4 = n0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 14:
# lpt0 = # avol, # lpt = # avol, istore2[m] = indexblock(indx, lax, m4), lpt[m] = mklp(m4, m5, LP_INDEX_NODES, m6), adr = adr0, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt, log0), log = log0, maxino = m0, ns = ns0, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems log0 ∩ ginval = ∅, dom gstore1 ∪ elems log0 = dom gstore2 ∪ ginval, m < # avol, ginval < # avol, abs-gstore(avol, lpt, gstore2, ginval), abs-istore(avol, lpt, istore2), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(pstate = readonly, bleb, lpt, avol), bufs-log-only(bleb, log0, lpt), flash-lpt-cons(lpt0, istore1, gstore1), freelist-cons(lpt, freelist), inv(indexblock(indx, lax, m4)), inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval), log-group-block(log0, lpt), lpt-free-unref(lpt0), lpt-free-unref(lpt), lpt-leb-size(lpt0), lpt-leb-size(lpt), lpt-ram-flash(lpt, lpt0, log0), m ∈ istore2, istore1 ⊑ istore2, pstate = unbuffered → isbuf, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → log0 ≠ [] ∧ pstate.lnum = log0.last ∧ pstate.lnum ∈ gstore2, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum), pstate = unbuffered → bleb = nobuffer, isbuf → synced(avol) ⊦ ⟨if m ∈ istore0 then n := istore0[m].ref-size else abort⟩ ( (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ m4 = n), dups(log0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_get_iblock_refsize# (LNUM, ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED ; ; N ) {if LNUM ∈ ISTORE then N := ISTORE[LNUM].ref-size else abort};