[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 49 from proof inv-io-read (previous step)

# buf = # buf2, # buf1 = # buf2, # buf2 = n3 + n0 + n, UBI_READ_RETRIES = n1 + m4, pebs[m3] = mkpeb(buf0, m2, false), m3 < # pebs, mtd-cons(pebs), range=(buf, n0 + n, buf2, n0 + n, n3), range=(buf, 0, buf2, 0, n0), range=(buf1, n0 + n, buf, n0 + n, n3), range=(buf1, 0, buf, 0, n0), m4 ≤ UBI_READ_RETRIES, m4 ≤ UBI_READ_RETRIES + 1, n0 + n ≤ # buf2, m1 + n ≤ PEB_SIZE, ⌊err1⌋ , ⌊err0⌋ ⊦ ⟪debug#("ubi-io: failed to read from PEB " + m3.toString); m := m4 + 1⟫ (m ≤ UBI_READ_RETRIES + 1 ∧ UBI_READ_RETRIES < n1 + m)

User applied rule insert program lemma

And obtained the following new goals

Proof step 50:
⊦ ⟪debug#(str)⟫ true
Proof step 51:
# buf2 = n3 + n0 + n, # buf1 = # buf2, # buf = # buf2, UBI_READ_RETRIES = n1 + m4, pebs[m3] = mkpeb(buf0, m2, false), str0 = "ubi-io: failed to read from PEB " + m3.toString, m3 < # pebs, mtd-cons(pebs), range=(buf1, 0, buf, 0, n0), range=(buf1, n0 + n, buf, n0 + n, n3), range=(buf, 0, buf2, 0, n0), range=(buf, n0 + n, buf2, n0 + n, n3), m1 + n ≤ PEB_SIZE, n0 + n ≤ # buf2, m4 ≤ UBI_READ_RETRIES + 1, m4 ≤ UBI_READ_RETRIES, ⌊err0⌋ , ⌊err1⌋ ⊦ ∀ . true → ⟪m := m4 + 1⟫ (m ≤ UBI_READ_RETRIES + 1 ∧ UBI_READ_RETRIES < n1 + m)

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → ["ubi-io: failed to read from PEB " + m3.toString] flags: List([[1,0,0]])

Proof step 49 from proof inv-io-read (previous step)

User applied rule insert program lemma

And obtained the following new goals

Rule argument

Additional information