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

# lpt = # avol, # lpt0 = # avol, lpt[pstate.lnum] = mklp(m, m0, LP_GROUP_NODES, m1), keyset(gch) = gc-heap(lpt, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, pstate.lnum < # avol, ginval < # avol, abs-gstore(avol, lpt, gstore, ginval), abs-istore(avol, lpt, istore), awbuf-inv(avol, buffered(pstate.lnum)), bin-heap-inv(gch, lpt), buf-ro-rw-mode(false, buffered(pstate.lnum), lpt, avol), bufs-log-only(buffered(pstate.lnum), log1, lpt), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log1, lpt), lpt-free-unref(lpt), lpt-free-unref(lpt0), lpt-leb-size(lpt), lpt-leb-size(lpt0), lpt-ram-flash(lpt, lpt0, log1), istore0 ⊑ istore, isbuf → synced(avol), pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore ⊦ pstate = unbuffered, pstate = readonly, dups(log1), # avol[pstate.lnum].data ≤ LEB_SIZE ∧ avol[pstate.lnum].mapped? ∧ m0 = # avol[pstate.lnum].data ∧ is-aligned(# avol[pstate.lnum].data, 2 * NODE_HEADER_SIZE)

User applied rule constructor cut

And obtained the following new goals

Proof step 11:
# lpt0 = # avol, # lpt = # avol, lpt[pstate.lnum] = mklp(m, m0, LP_GROUP_NODES, m1), keyset(gch) = gc-heap(lpt, log1), pstate = journal(m2), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, pstate.lnum < # avol, abs-gstore(avol, lpt, gstore, ginval), abs-istore(avol, lpt, istore), awbuf-inv(avol, buffered(pstate.lnum)), bin-heap-inv(gch, lpt), buf-ro-rw-mode(false, buffered(pstate.lnum), lpt, avol), bufs-log-only(buffered(pstate.lnum), log1, lpt), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(log1, lpt), lpt-free-unref(lpt0), lpt-free-unref(lpt), lpt-leb-size(lpt0), lpt-leb-size(lpt), lpt-ram-flash(lpt, lpt0, log1), istore0 ⊑ istore, pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, isbuf → synced(avol) ⊦ pstate = readonly, pstate = unbuffered, dups(log1), # avol[pstate.lnum].data ≤ LEB_SIZE ∧ avol[pstate.lnum].mapped? ∧ m0 = # avol[pstate.lnum].data ∧ is-aligned(# avol[pstate.lnum].data, 2 * NODE_HEADER_SIZE)

Rule argument

var: pstate

Additional information

Used simplifier rules: fwd-in-istore-lpt: ⊦ n ∈ istore ∧ abs-istore(avol, lpt, istore) → n < # lpt ∧ lpt[n].ref-size = istore[n].ref-size ∧ lpt[n].flags = LP_INDEX_NODES;%persistence-state freely generated by unbuffered, readonly, journal, index ;;% ⊦ index(m).lnum = m; (s)% ⊦ unbuffered ≠ index(m); (s)% ⊦ readonly ≠ index(m); (s)% ⊦ ¬ index(m).journal?; (s)% ⊦ index(m).index?; (s)%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv% ⊦ mklp(n2, n3, lpf, m).ref-size = n2; (s)% ⊦ mklp(n2, n3, lpf, m).flags = lpf; (s)% ⊦ LP_GROUP_NODES ≠ LP_INDEX_NODES; (s)