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

# buf = n1 + n0 + n, pebs[m] = mkpeb(buf1, m2, false), buf0 = buf, m1 = m, m < # pebs, mtd-cons(pebs), m0 + n ≤ PEB_SIZE, n0 + n ≤ # buf ⊦ ⟪if m1 < # pebs ∧ ¬ pebs[m1].bad ∧ m0 + n ≤ PEB_SIZE ∧ n0 + n ≤ # buf then {err := EIO; bitflips := false; let m = 0 in while err ≠ ESUCCESS ∧ m ≤ UBI_READ_RETRIES do {/* (inv-io-read : invariant m1 < # pebs ∧ ¬ pebs[m1].bad ∧ m0 + n ≤ PEB_SIZE ∧ n0 + n ≤ # buf ∧ m ≤ UBI_READ_RETRIES + 1 ∧ # buf = # buf` ∧ range=(buf, 0, buf`, 0, n0) ∧ range=(buf, n0 + n, buf`, n0 + n, # buf` - n0 + n) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf, n0, n) = subarray(pebs[m1].data, m0, n)) wfbound UBI_READ_RETRIES + 1 - m) */; mtd_asm_read#(m1, m0, n0, n, pebs; buf; bitflips, err); if err ≠ ESUCCESS then debug#("ubi-io: failed to read from PEB " + m1.toString); m := m +1}} else abort⟫ ( # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n0) ∧ range=(buf, n0 + n, buf0, n0 + n, n1) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf, n0, n) = subarray(buf1, m0, n)))

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 9:
# buf = n1 + n0 + n, pebs[m] = mkpeb(buf1, m2, false), buf0 = buf, m1 = m, m < # pebs, mtd-cons(pebs), n0 + n ≤ # buf, m0 + n ≤ PEB_SIZE ⊦ ⟪err := EIO; bitflips := false; let m = 0 in while err ≠ ESUCCESS ∧ m ≤ UBI_READ_RETRIES do {/* (inv-io-read : invariant m1 < # pebs ∧ ¬ pebs[m1].bad ∧ m0 + n ≤ PEB_SIZE ∧ n0 + n ≤ # buf ∧ m ≤ UBI_READ_RETRIES + 1 ∧ # buf = # buf` ∧ range=(buf, 0, buf`, 0, n0) ∧ range=(buf, n0 + n, buf`, n0 + n, # buf` - n0 + n) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf, n0, n) = subarray(pebs[m1].data, m0, n)) wfbound UBI_READ_RETRIES + 1 - m) */; mtd_asm_read#(m1, m0, n0, n, pebs; buf; bitflips, err); if err ≠ ESUCCESS then debug#("ubi-io: failed to read from PEB " + m1.toString); m := m +1}⟫ ( # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n0) ∧ range=(buf, n0 + n, buf0, n0 + n, n1) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf, n0, n) = subarray(buf1, m0, n)))

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ mkpeb(buf, m, boolvar).bad ↔ boolvar; (s)