[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 104 from proof prepost-erase-worker-helper (previous step)

# wlar = # wlar0, # apebs = # wlar0, # apebs0 = # wlar0, UBI_ERASE_RETRIES = n0 + vtblpnum2, apebs[m] = mkpeb(aehdr, avhdr, buf, m2, false), wlar[m] = wl-entry(m1, erasing), wlar0[m] = wl-entry(m0, erasing), err = err0, m < # wlar0, bflipset-cons(bflipset, wlar), bflipset-cons(bflipset, wlar0), id○(wlar, wlar0, m), id○(apebs, apebs0, m), ubi-io-inv(apebs), ubi-io-inv(apebs0), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf, m2, false)), unique-sqns(apebs), unique-sqns(apebs0), valid-ebatbl(apebs, wlar, vols, vtblpnum1), valid-ebatbl(apebs0, wlar0, vols, vtblpnum1), valid-eraseq(apebs, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(wlar, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(apebs0, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(wlar0, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(q0 + eq-entry(m, lref) ' + q1), valid-global-sqn(apebs, sqnum), valid-global-sqn(apebs0, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum1), valid-vtbl(apebs0, vols, wlar0, vtblpnum1), valid-wl(apebs, wlar), valid-wl(apebs0, wlar0), vtblpnum2 ≤ UBI_ERASE_RETRIES + 1, vtblpnum2 ≤ UBI_ERASE_RETRIES, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪wlar[m].ec := wlar[m].ec + 1; if err = ESUCCESS then aubi_io_write_echdr#(m, aechdr(wlar[m].ec); apebs; err) else debug#("ubi: erase of PEB " + m.toString + " failed"); vtblpnum := vtblpnum2 + 1⟫ ( vtblpnum ≤ UBI_ERASE_RETRIES + 1 ∧ m < # apebs ∧ id○(apebs, apebs0, m) ∧ id○(wlar, wlar0, m) ∧ # apebs = # wlar ∧ unique-sqns(apebs) ∧ valid-global-sqn(apebs, sqnum) ∧ valid-wl(apebs, wlar) ∧ valid-eraseq(wlar, q0 + eq-entry(m, lref) ' + q1) ∧ valid-eraseq(apebs, q0 + eq-entry(m, lref) ' + q1) ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs, wlar, vols, vtblpnum1) ∧ valid-vtbl(apebs, vols, wlar, vtblpnum1) ∧ ubi-io-inv(apebs) ∧ (err = ESUCCESS → apebs[m].echdr = aechdr(wlar[m].ec) ∧ apebs[m].vidhdr = empty ∧ ¬ apebs[m].bad) ∧ UBI_ERASE_RETRIES < n0 + vtblpnum), err = ESUCCESS, err1 = ESUCCESS, vtblpnum1 = m, VTBL_VOLID ∈ vols, vtblpnum1 ∈ q0, vtblpnum1 ∈ q1

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 105:
# apebs0 = # wlar0, # apebs = # wlar0, # wlar1 = # wlar0, UBI_ERASE_RETRIES = n0 + vtblpnum2, wlar0[m] = wl-entry(m0, erasing), wlar1[m] = wl-entry(m1, erasing), apebs[m] = mkpeb(aehdr, avhdr, buf, m2, false), err = err0, wlar = wlar1[m, wlar1[m].ec:= (wlar1[m].ec + 1)], m < # wlar0, m < # wlar1, bflipset-cons(bflipset, wlar0), bflipset-cons(bflipset, wlar1), id○(apebs, apebs0, m), id○(wlar1, wlar0, m), ubi-io-inv(apebs0), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf, m2, false)), unique-sqns(apebs0), unique-sqns(apebs), valid-ebatbl(apebs0, wlar0, vols, vtblpnum1), valid-ebatbl(apebs, wlar1, vols, vtblpnum1), valid-eraseq(q0 + eq-entry(m, lref) ' + q1), valid-eraseq(wlar0, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(apebs0, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(wlar1, q0 + eq-entry(m, lref) ' + q1), valid-eraseq(apebs, q0 + eq-entry(m, lref) ' + q1), valid-global-sqn(apebs0, sqnum), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs0, vols, wlar0, vtblpnum1), valid-vtbl(apebs, vols, wlar1, vtblpnum1), valid-wl(apebs0, wlar0), valid-wl(apebs, wlar1), vtblpnum2 ≤ UBI_ERASE_RETRIES, vtblpnum2 ≤ UBI_ERASE_RETRIES + 1, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then aubi_io_write_echdr#(m, aechdr(wlar[m].ec); apebs; err) else debug#("ubi: erase of PEB " + m.toString + " failed"); vtblpnum := vtblpnum2 + 1⟫ ( vtblpnum ≤ UBI_ERASE_RETRIES + 1 ∧ m < # apebs ∧ id○(apebs, apebs0, m) ∧ id○(wlar, wlar0, m) ∧ # apebs = # wlar ∧ unique-sqns(apebs) ∧ valid-global-sqn(apebs, sqnum) ∧ valid-wl(apebs, wlar) ∧ valid-eraseq(wlar, q0 + eq-entry(m, lref) ' + q1) ∧ valid-eraseq(apebs, q0 + eq-entry(m, lref) ' + q1) ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs, wlar, vols, vtblpnum1) ∧ valid-vtbl(apebs, vols, wlar, vtblpnum1) ∧ ubi-io-inv(apebs) ∧ (err = ESUCCESS → apebs[m].echdr = aechdr(wlar[m].ec) ∧ apebs[m].vidhdr = empty ∧ ¬ apebs[m].bad) ∧ UBI_ERASE_RETRIES < n0 + vtblpnum), err = ESUCCESS, err1 = ESUCCESS, vtblpnum1 = m, vtblpnum1 ∈ q1, vtblpnum1 ∈ q0, VTBL_VOLID ∈ vols

Rule argument

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)%a: ⊦ (q + q0) + q1 = q + q0 + q1; from specification list[erasequeue-base]% ⊦ valid-eraseq(wlar, q0 + eq-entry(m, lref) ' + q1) → ¬ # wlar ≤ m; (s)