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

apebs1[n] = mkpeb(aehdr0, avhdr0, buf0, m, false), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs = apebs1[n, mkpeb(empty, empty, mkempbuf(LEB_SIZE), 0, false)], err = ESUCCESS, err = err0, wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] [n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1) ], n < # apebs1, n < # apebs0, n < # wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)], n < # wlar, vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, vtblpnum1 ≤ UBI_ERASE_RETRIES, ⌊err2⌋ , ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [if err = ESUCCESS then aubi_io_write_echdr#(n, aechdr(wlar1[n].ec); apebs; err1) else debug#("ubi: erase of PEB " + n.toString + " failed"); vtblpnum1 := vtblpnum1 + 1] (id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)])), err1 = ESUCCESS, vtblpnum1 = 0

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information