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

apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs1 = apebs0[n, mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false)], err = err0, vtblpnum = n, vtblpnum0 = 1, wlar0 = wlar[n, wl-entry(m0 + 1, stat0)], n < # apebs0, n < # wlar, id○(wlar, wlar1, n), vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err0⌋ , ∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] ⊦ [if err1 = ESUCCESS then wlar1[vtblpnum] := wl-entry(wlar1[vtblpnum].ec, free) else {aubi_io_markbad#(vtblpnum; apebs; err1); if err1 = ESUCCESS then wlar1[vtblpnum] := wl-entry(wlar1[vtblpnum].ec, erroneous) else debug#("ubi: marking PEB " + vtblpnum.toString + " as bad failed")}] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1 = wlar[n, wl-entry(m0 + m, stat)], vtblpnum1 = 0, aehdr.valid?, err1 ≠ ESUCCESS ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information