[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 88 from proof refine-add-ind (previous step)

# lpt0 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt1 = # avol, isbuf ↔ isbuf2, avol[m1] = mapped(buf0), lpt1[m1] = mklp(m4, # buf0, LP_INDEX_NODES, m2), istore[m1] = indexblock(indx, lax, m4), adr = adr0, bleb = buffered(m1), buf = buf1, ¬ isbuf2, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, m0 = m, n0 = # buf1, ns = ns0, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, m1 < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), abs-node(buf1, ind), awbuf-inv(avol, buffered(m1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(m1), lpt1, avol), bufs-log-only(buffered(m1), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(indexblock(indx, lax, m4)), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log1, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log1), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, n0 ≤ # buf, # avol[bleb.leb].data + n0 ≤ LEB_SIZE, istore0 ⊑ istore, isbuf1 → synced(avol), bleb ≠ nobuffer → avol[bleb.leb].mapped? ∧ bleb.leb < # avol ∧ bleb.isbuf? ⊦ [fail_or_success#(; ; err); let m = bleb.leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n0)) else { choose n with n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) ifnone skip or skip; isbuf := true}] ( awbuf-inv(avol, buffered(m1)) ∧ # lpt0 = # avol → [adr := adr2; if err = ESUCCESS then {adr := @(buffered(m1).leb, lpt1[buffered(m1).leb].size, # buf1); lpt1[buffered(m1).leb] := mklp (lpt1[buffered(m1).leb].ref-size, lpt1[buffered(m1).leb].size + # buf1, lpt1[buffered(m1).leb].flags, lpt1[buffered(m1).leb].gcheapidx)} else lpt1[buffered(m1).leb] := mklp(lpt1[buffered(m1).leb].ref-size, LEB_SIZE, lpt1[buffered(m1).leb].flags, lpt1[buffered(m1).leb].gcheapidx)] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(buffered(m1), log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf, buffered(m1), lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) → ⟨pstate := index(m1); apersistence_add_ind#(ind, adr0, istore0, ginval, gstore, gstore0, log1, m, ns0; adr2, istore, pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ pstate ≠ unbuffered ∧ (pstate = readonly ↔ isbuf) ∧ (pstate ≠ readonly → m1 = pstate.lnum) ∧ adr = adr2 ∧ err = err0))), bleb = nobuffer, dups(log1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

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;% ⊦ mklp(n2, n3, lpf, m).flags = lpf; (s)% ⊦ indexblock(indx, lax, m).ref-size = m; (s)% ⊦ mklp(n2, n3, lpf, m).ref-size = n2; (s)% ⊦ mapped(buf).data = buf; (s)% ⊦ mapped(buf) = mapped(buf0) ↔ buf = buf0; (s)%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic% ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf)); (as)% ⊦ buffered(m).isbuf?; (s)% ⊦ m ≤ m; (s)% ⊦ buffered(m).leb = m; (s)% ⊦ nobuffer ≠ buffered(m); (s)