[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 28 from proof refine-set-gblock-refsize (previous step)

# lpt1 = # avol, # lpt0 = # avol, lpt1[m] = mklp(m1, m2, LP_GROUP_NODES, m3), gstore[m] = groupblock(gndx, lax, m1), keyset(gch) = gc-heap(lpt1, 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, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(pstate = readonly, bleb, lpt1, avol), bufs-log-only(bleb, log0, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(groupblock(gndx, lax, m1)), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log0, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log0), m ∈ log0, m ∈ gstore, istore0 ⊑ istore, ¬ dups(log0), ¬ m ∈ ginval, 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_set_gblock_refsize#(m, n, adr0, istore, istore0, ginval, gstore0, log0, m0, ns0, pstate, isbuf; gstore)⟩ ( abs-gstore(avol, lpt1[m, lpt1[m].ref-size:= n], gstore, ginval) ∧ (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)))

Heuristic weak unfold applied rule call right

And obtained the following new goals

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

Rule argument

pos: right 1

Additional information

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