[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 70 from proof refine-sync (previous step)

# lpt1 = # avol, # lpt0 = # avol, isbuf2 ↔ pstate = readonly, isbuf ↔ pstate = readonly, lpt1[bleb1.leb] = mklp(m0, m5, lpf, m4), adr = adr0, bleb = bleb1, err = ESUCCESS, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, ns = ns0, remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb1), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(pstate = readonly, bleb1, lpt1, avol), bufs-log-only(bleb1, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(log1, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log1), istore0 ⊑ istore, bleb1.isbuf? ∧ pstate ≠ readonly → bleb1.leb < # avol ∧ # avol[bleb1.leb].data ≤ LEB_SIZE ∧ avol[bleb1.leb].mapped? ∧ m5 = # avol[bleb1.leb].data ∧ lpf ≠ LP_FREE ∧ is-aligned(# avol[bleb1.leb].data, 2 * NODE_HEADER_SIZE), pstate = unbuffered → isbuf1, pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum), pstate = unbuffered → bleb1 = nobuffer, isbuf1 → synced(avol) ⊦ [if bleb1.isbuf? then let m0 = lpt1[bleb1.leb].size in if ¬ is-aligned(m0, EB_PAGE_SIZE) then let m3 = EB_PAGE_SIZE - m0 % EB_PAGE_SIZE in let buf = mkbuf(m3) in {persistence_encode_padding_node#(; buf; err); if err = ESUCCESS then {awbuf_write_buf#(# buf, buf, adr0, m, log1, lpt0, ns0, bleb1; avol, isbuf2; err); if err = ESUCCESS then lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + m3, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) else {debug#("persistence: flushing of LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf2)}} else {debug#("persistence: could not encode padding node"); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf2)}}] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(bleb1, log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf2, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) ∧ awbuf-inv(avol, bleb1) ∧ # lpt0 = # avol → ⟨apersistence_sync#(adr0, istore, istore0, ginval, gstore, gstore0, log1, m, ns0; pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ (pstate = unbuffered → bleb1 = nobuffer) ∧ (pstate = readonly ↔ isbuf2) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum)) ∧ err = err0)), pstate = readonly, dups(log1)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information