Proof step 210 from proof refine-add-gnds (previous step)

User applied rule case distinction

And obtained the following new goals

• Proof step 211:

  # lpt1 = # avol, # lpt0 = # avol, # buf0 = gndx0.flashsize, # gndx0 = # lax0, # gndx1 = # lax1, (elems nx ∪ dom gstore0) ++ n1 = dom gstore ∪ ginval, lpt1[n1] = mklp(m, # buf1, LP_GROUP_NODES, m3), avol[n1] = mapped(buf1), gstore[n1] = groupblock(gndx1, lax1, m), keyset(gch) = gc-heap(lpt1, nx + n1 '), pstate = journal(n1), remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, n < gndx0.flashsize, ginval < # avol, n1 < # avol, n0 < # lax0, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore2), abs-nodes(buf0, # buf1, gndx0, lax0, false), abs-nodes(buf1, gndx1, lax1, # buf1 = LEB_SIZE), abs-nodes(subarray(buf0, 0, n), # buf1, prefixn(n0, gndx0), prefixn(n0, lax0), true), awbuf-inv(avol[n1, mapped(buf1 + subarray(buf0, 0, n))], buffered(n1)), awbuf-inv(avol, buffered(n1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n1), lpt1, avol), bufs-log-only(buffered(n1), nx + n1 ', lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(groupblock(gndx1, lax1, m)), inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), is-aligned(# buf1 + n, EB_PAGE_SIZE), log-group-block(nx + n1 ', lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, nx + n1 '), n1 ∈ gstore, # buf1 + gndx0.flashsize ≤ LEB_SIZE, istore1 ⊑ istore2, ⌊err1⌋ , isbuf1 → synced(avol) ⊦ ⟨ax := prefixn(n0, lax0).to-adr(pstate.lnum), err0 := err1; gstore[pstate.lnum].gndlist := gstore[pstate.lnum].gndlist + prefixn(# prefixn(n0, lax0), gndx0); gstore[pstate.lnum].ladrlist := gstore[pstate.lnum].ladrlist + prefixn(n0, lax0); if err0 ≠ ESUCCESS then ax := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-gstore(avol[n1, mapped(avol[n1].data + subarray(buf0, 0, n))], lpt1[n1, mklp(m, LEB_SIZE, LP_GROUP_NODES, m3)], gstore, ginval) ∧ pstate = readonly ∧ lax0.to-adr(n1) = ax ∧ err1 = err0), gndx0 = [], lax0 = [], n = 0, n0 = # lax0, dups(nx), n1 ∈ nx, n1 ∈ ginval

• Proof step 228:

  # lpt1 = # avol, # lpt0 = # avol, # buf0 = gndx0.flashsize, # gndx0 = # lax0, # gndx1 = # lax1, (elems nx ∪ dom gstore0) ++ n1 = dom gstore ∪ ginval, lpt1[n1] = mklp(m, # buf1, LP_GROUP_NODES, m3), avol[n1] = mapped(buf1), gstore[n1] = groupblock(gndx1, lax1, m), keyset(gch) = gc-heap(lpt1, nx + n1 '), pstate = journal(n1), remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, n < gndx0.flashsize, ginval < # avol, n1 < # avol, n0 < # lax0, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore2), abs-nodes(buf0, # buf1, gndx0, lax0, false), abs-nodes(buf1, gndx1, lax1, # buf1 = LEB_SIZE), abs-nodes(subarray(buf0, 0, n), # buf1, prefixn(n0, gndx0), prefixn(n0, lax0), true), awbuf-inv(avol[n1, mapped(buf1 + subarray(buf0, 0, n))], buffered(n1)), awbuf-inv(avol, buffered(n1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n1), lpt1, avol), bufs-log-only(buffered(n1), nx + n1 ', lpt1), dups(lax1 + prefixn(n0, lax0)), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(groupblock(gndx1, lax1, m)), inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), is-aligned(# buf1 + n, EB_PAGE_SIZE), log-group-block(nx + n1 ', lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, nx + n1 '), n1 ∈ gstore, # buf1 + gndx0.flashsize ≤ LEB_SIZE, istore1 ⊑ istore2, ⌊err1⌋ , isbuf1 → synced(avol) ⊦ gndx0 = [], lax0 = [], n = 0, n0 = # lax0, dups(nx), n1 ∈ nx, n1 ∈ ginval

Rule argument

Additional information