Proof step 142 from proof prepost-write-once (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 143:

  # apebs0 = # wlar1, # apebs2 = # wlar0, q0.head = eq-entry(m4, lref0), LEB_SIZE = (n2 + m0) + m1, vols0[v][m] = unmapped, wlar0[vtblpnum1] = wl-entry(m5, free), apebs2[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), aehdr.valid?, m < # vols0[v], vtblpnum1 < # wlar0, bflipset-cons(bflipset, wlar1), bflipset-cons(bflipset, wlar0), id(apebs2, apebs0, mapped-pebs(vols0)), is-aligned(m1, EB_PAGE_SIZE), is-aligned(m0, EB_PAGE_SIZE), ubi-io-inv(apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)]), ubi-io-inv(apebs0), ubi-io-inv(apebs2), unique-sqns(apebs0), unique-sqns(apebs2), valid-ebatbl(apebs0, wlar1, vols0, vtblpnum2), valid-ebatbl(apebs2, wlar0, vols0, vtblpnum2), valid-eraseq(q1 + eq-entry(vtblpnum1, v × m) '), valid-eraseq(apebs0, q0), valid-eraseq(wlar1, q0), valid-eraseq(q0), valid-eraseq(q1), valid-eraseq(wlar0, q1), valid-eraseq(apebs2, q1), valid-global-sqn(apebs0, sqnum), valid-global-sqn(apebs2, sqnum), valid-peb(mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)), valid-vtbl(apebs0, vols0, wlar1, vtblpnum2), valid-vtbl(apebs2, vols0, wlar0, vtblpnum2), valid-wl(apebs0, wlar1), valid-wl(apebs2, wlar0), v ∈ vols0, m1 ≤ LEB_SIZE, m1 + m2 ≤ # buf, m0 + m1 ≤ LEB_SIZE, q1.lebrefs ⊆ q0.lebrefs, ⌊err0⌋ , apebs0 = apebs2 ∧ wlar1 = wlar0 ∧ q0 = q1 ∨ id○(apebs0, apebs2, vtblpnum1) ∧ id○(wlar1, wlar0, vtblpnum1) ∧ q0 = eq-entry(vtblpnum1, lref0) ' + q1 ⊦ m1 = 0, vtblpnum2 = vtblpnum1, valid-eraseq(apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)], q1), valid-eraseq(apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)], q1 + eq-entry(vtblpnum1, v × m) '), vtblpnum2 ∈ q1, VTBL_VOLID ∈ vols0, vtblpnum2 ∈ q0

Rule argument

Additional information