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

apebs[n] = mkpeb(aehdr1, avhdr0, buf0, m2, false), wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), err1 ≠ ESUCCESS, n < # apebs, n < # apebs0, n < # wlar, ⌊err2⌋ , ⌊err0⌋ , ¬ aehdr.valid? ⊦ [debug#("ubi: marking PEB " + n.toString + " as bad failed")] ∃ m, stat0. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar[n, wl-entry(wlar[n].ec + UBI_ERASE_RETRIES + 1, stat)] = wlar[n, wl-entry(m0 + m, stat0)]

User applied rule insert program lemma

And obtained the following new goals

Proof step 138:
⊦ ⟪debug#(str)⟫ true
Proof step 139:
apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs[n] = mkpeb(aehdr1, avhdr0, buf0, m2, false), str0 = "ubi: marking PEB " + n.toString + " as bad failed", n < # wlar, n < # apebs0, n < # apebs, ⌊err0⌋ , ⌊err2⌋ ⊦ err1 = ESUCCESS, aehdr.valid?, ∀ . true → (∃ m, stat0. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar[n, wl-entry(wlar[n].ec + UBI_ERASE_RETRIES + 1, stat)] = wlar[n, wl-entry(m0 + m, stat0)])

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → ["ubi: marking PEB " + n.toString + " as bad failed"] flags: <all paths>

Proof step 137 from proof wlar-erase-worker-helper (previous step)

User applied rule insert program lemma

And obtained the following new goals

Rule argument

Additional information