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

# apebs = # wlar, q0 = q, vols0 = vols, bflipset-cons(bflipset0, wlar), bflipset-cons(bflipset, wlar), ubi-io-inv(apebs), 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), boolvar → vtblpnum0 < # wlar ∧ wlar[vtblpnum0].status = free ∧ vtblpnum < # wlar ∧ wlar[vtblpnum].status = used ∧ (bflipset = ∅ → wlar[vtblpnum].ec + WL_THRESHOLD ≤ wlar[vtblpnum0].ec) ⊦ ⟪apebs0 := apebs; if boolvar then let avhdr = ?, bitflips = ? in {aubi_io_read_vidhdr#(vtblpnum, apebs; avhdr; bitflips, err); if err = ESUCCESS then let buf = mkbuf(LEB_SIZE) in {aubi_io_read_data#(vtblpnum, 0, 0, LEB_SIZE, apebs; buf; bitflips, err); if err = ESUCCESS then ubi_atomic_leb_change# (avhdr.vol, avhdr.leb, vtblpnum0, LEB_SIZE, buf, EB_PAGE_SIZE; vols, wlar, q, bflipset0, vtblpnum4, sqnum, apebs; err); if err ≠ ESUCCESS then debug#("ubi: wear-leveling of PEB " + vtblpnum.toString + " to PEB " + vtblpnum0.toString + " failed"); if err = ESUCCESS then {ubi_erase_worker_helper#(vtblpnum; wlar, apebs; err); if err = ESUCCESS then q := q.butlast}}} else err := ENOSPC⟫ ( # apebs = # wlar ∧ unique-sqns(apebs) ∧ valid-global-sqn(apebs, sqnum) ∧ valid-wl(apebs, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset0, wlar) ∧ valid-ebatbl(apebs, wlar, vols, vtblpnum4) ∧ valid-vtbl(apebs, vols, wlar, vtblpnum4) ∧ ubi-io-inv(apebs) ∧ ( vols0 = vols ∧ id(apebs, apebs0, mapped-pebs(vols)) ∧ q.lebrefs ⊆ q0.lebrefs ++ (VTBL_VOLID × VTBL_LNUM) ∨ (∃ v, m, n. v ∈ vols0 ∧ m < # vols0[v] ∧ vols0[v][m] ≠ unmapped ∧ vols = vols0[v, vols0[v][m, ⌜n⌝ ]] ∧ id(apebs, apebs0, mapped-pebs(vols0) -- vols0[v][m].pnum) ∧ apebs[n].data = apebs0[vols0[v][m].pnum].data ∧ apebs[n].fill ≤ apebs0[vols0[v][m].pnum].fill ∧ q.lebrefs ⊆ q0.lebrefs ++ (v × m)))), vtblpnum4 ∈ q, VTBL_VOLID ∈ vols

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information