[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 8 from proof refine-get-gc-block (previous step)

# lpt0 = # avol, # lpt = # avol, keyset(gch) = gc-heap(lpt, log0), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log0 ∩ ginval = ∅, dom gstore0 ∪ elems log0 = dom gstore ∪ ginval, ginval < # 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(istore0), inv(istore), inv(gstore0), inv(gstore \ 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), istore0 ⊑ istore, ¬ dups(log0), err ≠ ESUCCESS → n1 = n0, err = ESUCCESS → n1 < # avol ∧ lpt[n1].flags = LP_GROUP_NODES ∧ ¬ n1 ∈ log0, pstate = unbuffered → isbuf, pstate.index? → pstate.lnum ∈ istore, 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), err = ENOSPC ∨ err = ESUCCESS ⊦ ⟨apersistence_get_gc_block#(adr0, istore, istore0, ginval, gstore, gstore0, log0, m, ns0, pstate, isbuf; n0; err0)⟩ ( (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ n1 = n0 ∧ err = err0)

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 9:
# lpt = # avol, # lpt0 = # avol, adr = adr0, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt, log0), log = log0, maxino = m, ns = ns0, remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, elems log0 ∩ ginval = ∅, dom gstore1 ∪ elems log0 = dom gstore2 ∪ ginval, 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(gstore2 \ ginval), inv(gstore1), inv(istore2), inv(istore1), 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), istore1 ⊑ istore2, isbuf → synced(avol), pstate = unbuffered → bleb = nobuffer, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum), pstate.journal? → log0 ≠ [] ∧ pstate.lnum = log0.last ∧ pstate.lnum ∈ gstore2, pstate.index? → pstate.lnum ∈ istore2, pstate = unbuffered → isbuf, err1 = ESUCCESS → n1 < # avol ∧ lpt[n1].flags = LP_GROUP_NODES ∧ ¬ n1 ∈ log0, err1 ≠ ESUCCESS → n1 = n0, err1 = ENOSPC ∨ err1 = ESUCCESS ⊦ ⟨err := ENOSPC or choose n with n ∈ dom gstore0 ∧ ¬ n ∈ log in {n0 := n; err := ESUCCESS} ifnone err := ENOSPC⟩ ( (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ n1 = n0 ∧ err1 = err), dups(log0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_get_gc_block# (ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED ; N ; ERR ) { ERR := ENOSPC or choose N0 with N0 ∈ dom GSTORE ∧ ¬ N0 ∈ NL in {N := N0; ERR := ESUCCESS} ifnone ERR := ENOSPC };