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

# apebs0 = # wlar0, wlar0[m] = wl-entry(m0, erasing), apebs = apebs0, err = EIO, vtblpnum = 0, vtblpnum0 = m, wlar = wlar0, m < # wlar0, bflipset-cons(bflipset, wlar0), ubi-io-inv(apebs0), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar0, vols, vtblpnum1), 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(apebs0, sqnum), valid-vtbl(apebs0, vols, wlar0, vtblpnum1), valid-wl(apebs0, wlar0) ⊦ ⟪while err ≠ ESUCCESS ∧ vtblpnum ≤ UBI_ERASE_RETRIES do {wlar[vtblpnum0].ec := wlar[vtblpnum0].ec + 1; aubi_io_sync_erase#(vtblpnum0; apebs; err); if err = ESUCCESS then aubi_io_write_echdr#(vtblpnum0, aechdr(wlar[vtblpnum0].ec); apebs; err) else debug#("ubi: erase of PEB " + vtblpnum0.toString + " failed"); vtblpnum := vtblpnum + 1}; if err = ESUCCESS then wlar[vtblpnum0].status := free else {aubi_io_markbad#(vtblpnum0; apebs; err); if err = ESUCCESS then wlar[vtblpnum0].status := erroneous else debug#("ubi: marking PEB " + vtblpnum0.toString + " as bad failed")}⟫ ( ( err = ESUCCESS → # apebs = # wlar ∧ unique-sqns(apebs) ∧ valid-global-sqn(apebs, sqnum) ∧ valid-wl(apebs, wlar) ∧ valid-eraseq(wlar, q0 + q1) ∧ valid-eraseq(apebs, q0 + q1) ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs, wlar, vols, vtblpnum1) ∧ valid-vtbl(apebs, vols, wlar, vtblpnum1)) ∧ ( err ≠ ESUCCESS → # 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) ∧ wlar[m].status ≠ used ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ id○(wlar, wlar0, m) ∧ id○(apebs, apebs0, m) ∧ id(apebs, apebs0, mapped-pebs(vols))), vtblpnum1 = m, VTBL_VOLID ∈ vols, vtblpnum1 ∈ q0, vtblpnum1 ∈ q1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 10:
# apebs0 = # wlar0, wlar0[m] = wl-entry(m0, erasing), apebs = apebs0, err = EIO, vtblpnum = 0, vtblpnum0 = m, wlar = wlar0, vtblpnum1 ≠ m, m < # wlar0, bflipset-cons(bflipset, wlar0), ubi-io-inv(apebs0), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar0, vols, vtblpnum1), 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(apebs0, sqnum), valid-vtbl(apebs0, vols, wlar0, vtblpnum1), valid-wl(apebs0, wlar0), ¬ VTBL_VOLID ∈ vols, ¬ vtblpnum1 ∈ q0, ¬ vtblpnum1 ∈ q1 ⊦ ⟪while err ≠ ESUCCESS ∧ vtblpnum ≤ UBI_ERASE_RETRIES do {wlar[vtblpnum0].ec := wlar[vtblpnum0].ec + 1; aubi_io_sync_erase#(vtblpnum0; apebs; err); if err = ESUCCESS then aubi_io_write_echdr#(vtblpnum0, aechdr(wlar[vtblpnum0].ec); apebs; err) else debug#("ubi: erase of PEB " + vtblpnum0.toString + " failed"); vtblpnum := vtblpnum + 1}; if err = ESUCCESS then wlar[vtblpnum0] := wl-entry(wlar[vtblpnum0].ec, free) else {aubi_io_markbad#(vtblpnum0; apebs; err); if err = ESUCCESS then wlar[vtblpnum0] := wl-entry(wlar[vtblpnum0].ec, erroneous) else debug#("ubi: marking PEB " + vtblpnum0.toString + " as bad failed")}⟫ ( ( err = ESUCCESS → # apebs = # wlar ∧ unique-sqns(apebs) ∧ valid-global-sqn(apebs, sqnum) ∧ valid-wl(apebs, wlar) ∧ valid-eraseq(wlar, q0 + q1) ∧ valid-eraseq(apebs, q0 + q1) ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs, wlar, vols, vtblpnum1) ∧ valid-vtbl(apebs, vols, wlar, vtblpnum1)) ∧ ( err ≠ ESUCCESS → # 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) ∧ wlar[m].status ≠ used ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ id○(wlar, wlar0, m) ∧ id○(apebs, apebs0, m) ∧ id(apebs, apebs0, mapped-pebs(vols)))

Rule argument

Additional information

Used simplifier rules: lf-valid-vtbl-neq-erasing: ⊦ wlar[m] = wl-entry(m0, erasing) ∧ valid-vtbl(apebs, vols, wlar, n) → n ≠ m;%lf-vtbl-info: ⊦ valid-vtbl(apebs, vols, wlar, n) ∧ valid-eraseq(wlar, q) → ¬ n ∈ q;%a: ⊦ (q + q0) + q1 = q + q0 + q1; from specification list[erasequeue-base]% ⊦ n ≠ n0 → (n ∈ eq-entry(n0, lref) ' + q ↔ n ∈ q); (s)% ⊦ n ∈ q0 + q1 ↔ n ∈ q0 ∨ n ∈ q1; (ss)%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic% ⊦ wle.status:= stat = wl-entry(wle.ec, stat); (s)