[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 325 from proof refine-write (previous step)

# apebs = # wlar, vols[v][vtblpnum3] = ⌜n4⌝ , avols[v][vtblpnum3] = mapped(buf2, m), wlar[n4] = wl-entry(m1, used), apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), n1 ≠ 0, vtblpnum4 ≠ n4, aehdr.valid?, avhdr.valid?, vtblpnum3 < # avols[v], n4 < # wlar, vtblpnum3 < # vols[v], abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(vtblpnum5, EB_PAGE_SIZE), is-aligned(n1, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), v ∈ avols, v ∈ vols, vtblpnum5 ≤ LEB_SIZE, m ≤ LEB_SIZE, m0 ≤ LEB_SIZE, vtblpnum5 + n1 ≤ LEB_SIZE, n3 + n1 ≤ # buf, n1 + n3 ≤ # buf, m ≤ vtblpnum5, m0 ≤ vtblpnum5, ⌊err3⌋ , ¬ VTBL_VOLID ∈ vols ⊦ ⟪debug#("ubi: moving data from PEB " + vols[v][vtblpnum3].pnum.toString); ubi_change# (v, vtblpnum3, vtblpnum5 + n1, copy(buf, n3, copy(buf2, 0, mkbuf(vtblpnum5 + n1), 0, vtblpnum5), vtblpnum5, n1), EB_PAGE_SIZE ; vols, wlar, q, bflipset, vtblpnum4, sqnum, apebs ; err0)⟫ ⟨ebm_write#(v, vtblpnum3, vtblpnum5, n3, n1, buf; avols; err1)⟩ (abs(avols, apebs, vols, q) ∧ err0 = err1)

User applied rule insert program lemma

And obtained the following new goals

Proof step 326:
⊦ ⟪debug#(str)⟫ true
Proof step 327:
# apebs = # wlar, apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), wlar[n4] = wl-entry(m1, used), avols[v][vtblpnum3] = mapped(buf2, m), vols[v][vtblpnum3] = ⌜n4⌝ , str0 = "ubi: moving data from PEB " + vols[v][vtblpnum3].pnum.toString, avhdr.valid?, aehdr.valid?, n4 < # wlar, vtblpnum3 < # avols[v], vtblpnum3 < # vols[v], abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(n1, EB_PAGE_SIZE), is-aligned(vtblpnum5, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), v ∈ avols, v ∈ vols, m0 ≤ vtblpnum5, m ≤ vtblpnum5, n1 + n3 ≤ # buf, n3 + n1 ≤ # buf, vtblpnum5 + n1 ≤ LEB_SIZE, m0 ≤ LEB_SIZE, m ≤ LEB_SIZE, vtblpnum5 ≤ LEB_SIZE, ⌊err3⌋ ⊦ ∀ . true → ⟪ubi_change# (v, vtblpnum3, vtblpnum5 + n1, copy(buf, n3, copy(buf2, 0, mkbuf(vtblpnum5 + n1), 0, vtblpnum5), vtblpnum5, n1), EB_PAGE_SIZE ; vols, wlar, q, bflipset, vtblpnum4, sqnum, apebs ; err0)⟫ ⟨ebm_write#(v, vtblpnum3, vtblpnum5, n3, n1, buf; avols; err1)⟩ (abs(avols, apebs, vols, q) ∧ err0 = err1), vols[v][vtblpnum3] = unmapped, n1 = 0, vtblpnum4 = n4, VTBL_VOLID ∈ vols

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → [ "ubi: moving data from PEB " + vols[v][vtblpnum3].pnum.toString] flags: <all paths>

Additional information

Used simplifier rules: ⊦ v ∈ avols ∧ m < # avols[v] ∧ abs(avols, apebs, vols, q) → m < # vols[v]; (ss)% ⊦ v ∈ avols ∧ abs(avols, apebs, vols, q) → v ∈ vols; (ss)%abs-vols-unmapped: ⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = unmapped ∧ abs(avols, apebs, vols, q) → ¬ avols[v][m].mapped?; (forward) from specification ubi-abs% ⊦ unmapped ≠ ⌜m⌝ ; (s)