Proof step 48 from proof inv-add-ind (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

• Proof step 49:

  # lpt0 = # avol[m, mapped(avol[m].data + subarray(buf1, 0, # buf1))], # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt1 = # avol, # lpt0 = # avol, isbuf ↔ false, avol[n] = mapped(buf0), lpt1[n] = mklp(m1, # buf0, LP_INDEX_NODES, m2), err = err0, err = ESUCCESS, keyset(gch) = gc-heap(lpt1, log0), m = buffered(n).leb, buffered(n).isbuf?, avol[m].mapped?, m < # avol, n < # avol, abs-node(buf1, ind), awbuf-inv(avol[m, mapped(avol[m].data + subarray(buf1, 0, # buf1))], buffered(n)), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), log0, lpt1), freelist-cons(lpt1, freelist), log-group-block(log0, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log0), 0 + # buf1 ≤ # buf1, # buf0 + # buf1 ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then {adr := @(buffered(n).leb, lpt1[buffered(n).leb].size, # buf1); lpt1[buffered(n).leb] := mklp (lpt1[buffered(n).leb].ref-size, lpt1[buffered(n).leb].size + # buf1, lpt1[buffered(n).leb].flags, lpt1[buffered(n).leb].gcheapidx)} else lpt1[buffered(n).leb] := mklp(lpt1[buffered(n).leb].ref-size, LEB_SIZE, lpt1[buffered(n).leb].flags, lpt1[buffered(n).leb].gcheapidx)⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(buffered(n), log0, lpt1) ∧ # lpt1 = # avol[m, mapped(avol[m].data + subarray(buf1, 0, # buf1))] ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf, buffered(n), lpt1, avol[m, mapped(avol[m].data + subarray(buf1, 0, # buf1))]) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0))

Rule argument

Additional information