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

# lpt = # avol, # lpt0 = # avol, lpt[m2] = mklp(m, m0, LP_INDEX_NODES, m1), istore[m2] = indexblock(indx, lax, m), keyset(gch) = gc-heap(lpt, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, avol[m2].mapped?, ginval < # avol, m2 < # avol, abs-gstore(avol, lpt, gstore, ginval), abs-nodes(avol[m2].data, indexblock(indx, lax, m).indlist, indexblock(indx, lax, m).ladrlist, mklp(m, m0, LP_INDEX_NODES, m1).size = LEB_SIZE), awbuf-inv(avol, buffered(m2)), bin-heap-inv(gch, lpt), buf-ro-rw-mode(false, buffered(m2), lpt, avol), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(indexblock(indx, lax, m)), 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), m2 ∈ istore, istore0 ⊑ istore, isbuf → synced(avol), mklp(m, m0, LP_INDEX_NODES, m1).size ≠ LEB_SIZE → mklp(m, m0, LP_INDEX_NODES, m1).size = # avol[m2].data ⊦ dups(log1), # avol[m2].data ≤ LEB_SIZE ∧ avol[m2].mapped? ∧ m0 = # avol[m2].data ∧ is-aligned(# avol[m2].data, 2 * NODE_HEADER_SIZE)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 48:
# indx = # lax, # lpt = # avol, # lpt0 = # avol, avol[m2] = mapped(buf), lpt[m2] = mklp(m, m0, LP_INDEX_NODES, m1), istore[m2] = indexblock(indx, lax, m), keyset(gch) = gc-heap(lpt, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, m2 < # avol, abs-gstore(avol, lpt, gstore, ginval), abs-nodes(buf, indx, lax, m0 = LEB_SIZE), awbuf-inv(avol, buffered(m2)), bin-heap-inv(gch, lpt), buf-ro-rw-mode(false, buffered(m2), lpt, avol), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(indexblock(indx, lax, m)), 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), m2 ∈ istore, # buf ≤ LEB_SIZE, istore0 ⊑ istore, isbuf → synced(avol), m0 ≠ LEB_SIZE → m0 = # buf ⊦ dups(log1), is-aligned(# buf, 2 * NODE_HEADER_SIZE) ∧ m0 = # buf

Rule argument

Additional information

Used simplifier rules: ⊦ awbuf-inv(avol, bleb) ∧ n < # avol ∧ avol[n] = mapped(buf) → ¬ LEB_SIZE < # buf; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)% ⊦ mapped(buf).mapped?; (s)% ⊦ mapped(buf).data = buf; (s)%abs-nodes-elems-adr-length: ⊦ abs-nodes(buf, indx, lax, weak) → # indx = # lax; (forward) from specification abs-list[encoding-index-node]% ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf)); (as)% ⊦ mklp(n2, n3, lpf, m).size = n3; (s)% ⊦ indexblock(indx, lax, m).ladrlist = lax; (s)% ⊦ indexblock(indx, lax, m).indlist = indx; (s)