[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 85 from proof inv-wl-worker (previous step)

# wlar0 = # wlar, # apebs = # wlar, # apebs1 = # wlar, wlar[vtblpnum1] = wl-entry(m0, free), wlar[vtblpnum2] = wl-entry(m1, used), apebs[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), apebs[vtblpnum2] = mkpeb(aehdr1, avhdr, buf, m3, false), err = ESUCCESS, aehdr.valid?, vtblpnum1 < # wlar, vtblpnum2 < # wlar, bflipset-cons(bflipset0, wlar), bflipset-cons(bflipset, wlar), bflipset-cons(bflipset1, wlar0), id(apebs1, apebs, mapped-pebs(vols)), id○(apebs1, apebs, vtblpnum1), is-aligned(LEB_SIZE, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-inv(apebs1), ubi-io-peb-inv(mkpeb(aehdr1, avhdr, buf, m3, false)), unique-sqns(apebs), unique-sqns(apebs1), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-eraseq(apebs1, q1), valid-eraseq(wlar0, q1), valid-eraseq(q1), valid-global-sqn(apebs, sqnum), valid-global-sqn(apebs1, sqnum0), valid-peb(mkpeb(aehdr1, avhdr, buf, m3, false)), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), valid-wl(apebs1, wlar0), bflipset = ∅ → m1 + WL_THRESHOLD ≤ m0, err ≠ ESUCCESS → q1.lebrefs = q.lebrefs, err = ESUCCESS → apebs1[vtblpnum1].fill = align↑(datasize(apebs1[vtblpnum1].data, LEB_SIZE), EB_PAGE_SIZE) ∧ apebs1[vtblpnum1].data = buf ∧ q1.lebrefs ⊆ q.lebrefs ++ (avhdr.vol × avhdr.leb), avhdr.vol ∈ vols ∧ err = ESUCCESS → vols1 = vols[avhdr.vol, vols[avhdr.vol][avhdr.leb, ⌜vtblpnum1⌝ ]], avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM ∨ err ≠ ESUCCESS → vols1 = vols, err = ESUCCESS ∧ avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM → q1 = q + eq-entry(vtblpnum4, avhdr.vol × avhdr.leb) ', err = ESUCCESS ∧ avhdr.vol ∈ vols ∧ vols[avhdr.vol][avhdr.leb] ≠ unmapped → q1 = q + eq-entry(vols[avhdr.vol][avhdr.leb].pnum, avhdr.vol × avhdr.leb) ', err = ESUCCESS ∧ avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM → (∀ v, m. ¬ v ∈ vols ∧ is-encoded(to-vtbl(vols)[v, m], buf) → valid-ebatbl(apebs1, wlar0, vols1[v, fill(mkebatbl(m), unmapped)], vtblpnum) ∧ valid-vtbl(apebs1, vols1[v, fill(mkebatbl(m), unmapped)], wlar0, vtblpnum)), avhdr.vol ∈ vols ∨ is-encoded(to-vtbl(vols), buf) ∨ err ≠ ESUCCESS → valid-ebatbl(apebs1, wlar0, vols1, vtblpnum) ∧ valid-vtbl(apebs1, vols1, wlar0, vtblpnum), avhdr.vol ∈ vols ∧ avhdr.leb < # vols[avhdr.vol] ∨ avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM, err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪ubi_erase_worker_helper#(vtblpnum2; wlar0, apebs1; err); if err = ESUCCESS then q1 := q1.butlast⟫ ( # apebs1 = # wlar0 ∧ unique-sqns(apebs1) ∧ valid-global-sqn(apebs1, sqnum0) ∧ valid-wl(apebs1, wlar0) ∧ valid-eraseq(q1) ∧ valid-eraseq(wlar0, q1) ∧ valid-eraseq(apebs1, q1) ∧ bflipset-cons(bflipset1, wlar0) ∧ valid-ebatbl(apebs1, wlar0, vols1, vtblpnum) ∧ valid-vtbl(apebs1, vols1, wlar0, vtblpnum) ∧ ubi-io-inv(apebs1) ∧ ( vols = vols1 ∧ id(apebs1, apebs, mapped-pebs(vols1)) ∧ q1.lebrefs ⊆ q.lebrefs ++ (VTBL_VOLID × VTBL_LNUM) ∨ (∃ v, m, n. v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] ≠ unmapped ∧ vols1 = vols[v, vols[v][m, ⌜n⌝ ]] ∧ id(apebs1, apebs, mapped-pebs(vols) -- vols[v][m].pnum) ∧ apebs1[n].data = apebs[vols[v][m].pnum].data ∧ apebs1[n].fill ≤ apebs[vols[v][m].pnum].fill ∧ q1.lebrefs ⊆ q.lebrefs ++ (v × m)))), vtblpnum4 = vtblpnum1, vtblpnum2 ∈ q, vtblpnum4 ∈ q, VTBL_VOLID ∈ vols, VTBL_VOLID ∈ vols1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 86:
# wlar0 = # wlar, # apebs = # wlar, # apebs1 = # wlar, apebs1[vtblpnum1].fill = align↑(datasize(apebs1[vtblpnum1].data, LEB_SIZE), EB_PAGE_SIZE), wlar[vtblpnum1] = wl-entry(m0, free), wlar[vtblpnum2] = wl-entry(m1, used), apebs[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), apebs[vtblpnum2] = mkpeb(aehdr1, avhdr, apebs1[vtblpnum1].data, m3, false), vtblpnum4 ≠ vtblpnum1, aehdr.valid?, vtblpnum1 < # wlar, vtblpnum2 < # wlar, bflipset-cons(bflipset0, wlar), bflipset-cons(bflipset, wlar), bflipset-cons(bflipset1, wlar0), id(apebs1, apebs, mapped-pebs(vols)), id○(apebs1, apebs, vtblpnum1), is-aligned(LEB_SIZE, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-inv(apebs1), ubi-io-peb-inv(mkpeb(aehdr1, avhdr, apebs1[vtblpnum1].data, m3, false)), unique-sqns(apebs), unique-sqns(apebs1), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-eraseq(apebs1, q1), valid-eraseq(wlar0, q1), valid-eraseq(q1), valid-global-sqn(apebs, sqnum), valid-global-sqn(apebs1, sqnum0), valid-peb(mkpeb(aehdr1, avhdr, apebs1[vtblpnum1].data, m3, false)), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), valid-wl(apebs1, wlar0), q1.lebrefs ⊆ q.lebrefs ++ (avhdr.vol × avhdr.leb), ¬ vtblpnum2 ∈ q, ¬ vtblpnum4 ∈ q, ¬ VTBL_VOLID ∈ vols, ¬ VTBL_VOLID ∈ vols1, avhdr.vol ∈ vols → vols1 = vols[avhdr.vol, vols[avhdr.vol][avhdr.leb, ⌜vtblpnum1⌝ ]], avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM → vols1 = vols, avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM → q1 = q + eq-entry(vtblpnum4, avhdr.vol × avhdr.leb) ', avhdr.vol ∈ vols ∧ vols[avhdr.vol][avhdr.leb] ≠ unmapped → q1 = q + eq-entry(vols[avhdr.vol][avhdr.leb].pnum, avhdr.vol × avhdr.leb) ', avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM → (∀ v, m. ¬ v ∈ vols ∧ is-encoded(to-vtbl(vols)[v, m], apebs1[vtblpnum1].data) → valid-ebatbl(apebs1, wlar0, vols1[v, fill(mkebatbl(m), unmapped)], vtblpnum) ∧ valid-vtbl(apebs1, vols1[v, fill(mkebatbl(m), unmapped)], wlar0, vtblpnum)), avhdr.vol ∈ vols ∨ is-encoded(to-vtbl(vols), apebs1[vtblpnum1].data) → valid-ebatbl(apebs1, wlar0, vols1, vtblpnum) ∧ valid-vtbl(apebs1, vols1, wlar0, vtblpnum), bflipset = ∅ → m1 + WL_THRESHOLD ≤ m0, avhdr.vol ∈ vols ∧ avhdr.leb < # vols[avhdr.vol] ∨ avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM ⊦ ⟪ubi_erase_worker_helper#(vtblpnum2; wlar0, apebs1; err); if err = ESUCCESS then q1 := q1.butlast⟫ ( # apebs1 = # wlar0 ∧ unique-sqns(apebs1) ∧ valid-global-sqn(apebs1, sqnum0) ∧ valid-wl(apebs1, wlar0) ∧ valid-eraseq(q1) ∧ valid-eraseq(wlar0, q1) ∧ valid-eraseq(apebs1, q1) ∧ bflipset-cons(bflipset1, wlar0) ∧ valid-ebatbl(apebs1, wlar0, vols1, vtblpnum) ∧ valid-vtbl(apebs1, vols1, wlar0, vtblpnum) ∧ ubi-io-inv(apebs1) ∧ ( vols = vols1 ∧ id(apebs1, apebs, mapped-pebs(vols1)) ∧ q1.lebrefs ⊆ q.lebrefs ++ (VTBL_VOLID × VTBL_LNUM) ∨ (∃ v, m, n. v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] ≠ unmapped ∧ vols1 = vols[v, vols[v][m, ⌜n⌝ ]] ∧ id(apebs1, apebs, mapped-pebs(vols) -- vols[v][m].pnum) ∧ apebs1[n].data = apebs[vols[v][m].pnum].data ∧ apebs1[n].fill ≤ apebs[vols[v][m].pnum].fill ∧ q1.lebrefs ⊆ q.lebrefs ++ (v × m))))

Rule argument

Additional information

Used simplifier rules: ubi-io-inv-fwd: n < # apebs ⊦ apebs[n] = apeb ∧ ubi-io-inv(apebs) → ubi-io-peb-inv(apeb);%lf-used-valid-peb: ⊦ n < # wlar ∧ wlar[n] = wl-entry(m, used) ∧ apebs[n] = apeb ∧ valid-wl(apebs, wlar) → valid-peb(apeb);% ⊦ m < n → (n ≤ m ↔ false); (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)