| # lpt0 = # avol, # lpt1 = # avol, EB_PAGE_SIZE = # buf1 + # buf0 % EB_PAGE_SIZE, avol[n] = mapped(buf0), lpt1[n] = mklp(m0, # buf0, lpf0, m1), keyset(gch) = gc-heap(lpt1, log0), n < # avol, abs-padding(buf1), 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), is-aligned(# buf0, 2 * NODE_HEADER_SIZE), 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), # buf0 + # buf1 ≤ LEB_SIZE, # buf0 ≤ LEB_SIZE, ⌊err0⌋ ⊦ buf1 = mkbuf(0), lpf0 = LP_FREE, is-aligned(# buf0, EB_PAGE_SIZE), gc-heap(lpt1, log0) = gc-heap(lpt1[n, mklp(m0, LEB_SIZE, lpf0, m1)], log0) ∧ log-group-block(log0, lpt1[n, mklp(m0, LEB_SIZE, lpf0, m1)]) |
lpf0 ≠ LP_GROUP_NODES, lpf1 ≠ LP_GROUP_NODES, n < # lpt ⊦ lpt[n] = mklp(m0, m1, lpf0, m2) → gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx) = gc-heap(lpt, nx)
Used simplifier rules: n < # lpt, lpf ≠ LP_GROUP_NODES ⊦ lpt[n] = mklp(n0, n1, lpf, n2) ∧ log-group-block(nx, lpt) → log-group-block(nx, lpt[n, lp]); (s)% ⊦ LP_FREE ≠ LP_GROUP_NODES; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)%n < # lpt ⊦ lpt[n] = mklp(m0, m1, LP_GROUP_NODES, m2) → gc-heap(lpt[n, mklp(m0, n1, LP_GROUP_NODES, n2)], nx) = gc-heap(lpt, nx); (s)%n < # lpt ⊦ lpt[n] = mklp(n0, n1, LP_GROUP_NODES, n2) ∧ log-group-block(nx, lpt) → log-group-block(nx, lpt[n, mklp(m0, m1, LP_GROUP_NODES, m2)]); (s) Used terms: lpf0, m0, # buf0, m1, log0, m1, lpf0, LEB_SIZE, m0, n, lpt1