Proof step 52 from proof inv-create-volume (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

• Proof step 53:

  # apebs2 = # wlar2, # apebs = # wlar, # apebs0 = # wlar2, # buf0 = LEB_SIZE, # wlar0 = # wlar2, wlar2[vtblpnum] = wl-entry(m, free), apebs0[vtblpnum] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), err = ESUCCESS, vols0 = vols, aehdr.valid?, vtblpnum < # wlar2, bflipset-cons(bflipset0, wlar0), bflipset-cons(bflipset, wlar), bflipset-cons(bflipset, wlar2), id(apebs2, apebs, mapped-pebs(vols)), id(apebs2, apebs0, mapped-pebs(vols)), id(apebs0, apebs, mapped-pebs(vols)), id○(apebs2, apebs0, vtblpnum), is-aligned(LEB_SIZE, EB_PAGE_SIZE), is-encoded(to-vtbl(vols)[v, n], buf0), ubi-io-inv(apebs2), ubi-io-inv(apebs), ubi-io-inv(apebs0), unique-sqns(apebs2), unique-sqns(apebs), unique-sqns(apebs0), valid-ebatbl(apebs, wlar, vols, vtblpnum3), valid-ebatbl(apebs0, wlar2, vols, vtblpnum3), valid-eraseq(q1), valid-eraseq(wlar0, q1), valid-eraseq(apebs2, q1), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-eraseq(wlar2, []), valid-global-sqn(apebs2, sqnum0), valid-global-sqn(apebs, sqnum), valid-global-sqn(apebs0, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum3), valid-vtbl(apebs0, vols, wlar2, vtblpnum3), valid-wl(apebs2, wlar0), valid-wl(apebs, wlar), valid-wl(apebs0, wlar2), 2 * ENCODED_NAT_SIZE + (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) * # vols + ENCODED_VOLID_SIZE ≤ LEB_SIZE, # to-vtbl(vols)[v, n] * (ENCODED_NAT_SIZE + ENCODED_VOLID_SIZE) + ENCODED_NAT_SIZE ≤ LEB_SIZE, err = ESUCCESS → q1 = eq-entry(vtblpnum3, VTBL_VOLID × VTBL_LNUM) ', err = ESUCCESS → apebs2[vtblpnum].fill = align↑(datasize(apebs2[vtblpnum].data, LEB_SIZE), EB_PAGE_SIZE) ∧ apebs2[vtblpnum].data = buf0 ∧ q1.lebrefs ⊆ ∅ ++ (VTBL_VOLID × VTBL_LNUM), err ≠ ESUCCESS → q1.lebrefs = ∅, to-vtbl(vols)[v, n] = to-vtbl(vols) ∨ err ≠ ESUCCESS → valid-ebatbl(apebs2, wlar0, vols, vtblpnum0) ∧ valid-vtbl(apebs2, vols, wlar0, vtblpnum0), err = ESUCCESS → (∀ v0, m0. ¬ v0 ∈ vols ∧ to-vtbl(vols)[v, n] = to-vtbl(vols)[v0, m0] → valid-ebatbl(apebs2, wlar0, vols[v0, fill(mkebatbl(m0), unmapped)], vtblpnum0) ∧ valid-vtbl(apebs2, vols[v0, fill(mkebatbl(m0), unmapped)], wlar0, vtblpnum0)), err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪vols := vols[v, mkebatbl(n)][v, fill(vols[v, mkebatbl(n)][v], unmapped)]⟫ ( ¬ VTBL_VOLID ∈ vols ∧ valid-ebatbl(apebs2, wlar0, vols, vtblpnum0) ∧ valid-vtbl(apebs2, vols, wlar0, vtblpnum0) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ id(apebs2, apebs, mapped-pebs(vols)) ∧ (err = ESUCCESS → ¬ v ∈ vols0 ∧ vols = vols0[v, fill(mkebatbl(n), unmapped)] ∧ q1.lebrefs ⊆ ∅ ++ (VTBL_VOLID × VTBL_LNUM)) ∧ (err ≠ ESUCCESS → q1.lebrefs ⊆ q.lebrefs ∧ vols = vols0)), v = VTBL_VOLID, vtblpnum3 = vtblpnum, VTBL_VOLID ∈ vols, vtblpnum3 ∈ q, v ∈ vols

Rule argument

Additional information