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

# lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ] = # avol, # lpt0 = # avol, # lpt0 = # avol0, # lpt1 = # avol0, isbuf ↔ false, isbuf2 ↔ isbuf, EB_PAGE_SIZE = # buf1 + # buf0 % EB_PAGE_SIZE, avol0[pstate.lnum] = mapped(buf0), lpt1[pstate.lnum] = mklp(m1, # buf0, lpf, m4), avol = avol0[m, mapped(avol0[m].data + subarray(buf1, 0, # buf1))], bleb1 = buffered(pstate.lnum), err = ESUCCESS, err = err0, keyset(gch) = gc-heap (lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ], log1), keyset(gch) = gc-heap(lpt1, log1), m = buffered(pstate.lnum).leb, m0 = lpt1[buffered(pstate.lnum).leb].size, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, bleb1.isbuf?, buffered(pstate.lnum).isbuf?, avol0[m].mapped?, bleb1.leb < # lpt1, m < # avol0, ginval < # avol0, pstate.lnum < # avol0, buffered(pstate.lnum).leb < # lpt1, abs-gstore(avol0, lpt1, gstore, ginval), abs-istore(avol0, lpt1, istore), abs-padding(buf1), awbuf-inv(avol, bleb1), awbuf-inv(avol0, buffered(pstate.lnum)), bin-heap-inv (gch, lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ]), bin-heap-inv(gch, lpt1), buf-ro-rw-mode (isbuf2, bleb1, lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ], avol), buf-ro-rw-mode(false, buffered(pstate.lnum), lpt1, avol0), bufs-log-only (bleb1, log1, lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ]), bufs-log-only(buffered(pstate.lnum), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons (lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ], freelist), freelist-cons(lpt1, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), is-aligned(# buf0, 2 * NODE_HEADER_SIZE), log-group-block (log1, lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ]), log-group-block(log1, lpt1), lpt-free-unref (lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ]), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size (lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ]), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash (lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ], lpt0, log1), lpt-ram-flash(lpt1, lpt0, log1), 0 + # buf1 ≤ # buf1, # buf0 ≤ LEB_SIZE, # buf0 + # buf1 ≤ LEB_SIZE, EB_PAGE_SIZE ≥ m0 % EB_PAGE_SIZE, istore0 ⊑ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore, pstate.index? ∨ pstate.journal?, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟨isbuf1 := false; apersistence_sync#(adr0, istore, istore0, ginval, gstore, gstore0, log1, m2, ns0; pstate, isbuf1; err1)⟩ ( abs-istore (avol, lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ], istore) ∧ abs-gstore (avol, lpt1 [bleb1.leb, mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ], gstore, ginval) ∧ ginval < # lpt1 [bleb1.leb, mklp (lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) ] ∧ (isbuf1 → synced(avol)) ∧ (pstate = unbuffered → bleb1 = nobuffer) ∧ (pstate = readonly ↔ isbuf2) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum)) ∧ err = err1), EB_PAGE_SIZE = 0, buf1 = mkbuf(0), lpf = LP_FREE, pstate = readonly, pstate = unbuffered, dups(log1), is-aligned(# buf0, EB_PAGE_SIZE)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information