[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 21 from proof refine-read-data (previous step)

# buf0 = n3 + n2 + n1, # buf3 = # buf0, pebs[m3] = mkpeb(buf2, m4, false), apebs[m3] = mkpeb(aehdr, avhdr, buf1, m2, false), m3 < # apebs, m3 < # pebs, abs(pebs, apebs), abs-peb(mkpeb(buf2, m4, false), mkpeb(aehdr, avhdr, buf1, m2, false)), mtd-cons(pebs), range=(buf3, n2 + n1, buf0, n2 + n1, n3), range=(buf3, 0, buf0, 0, n2), ubi-io-inv(apebs), m1 + n1 ≤ LEB_SIZE, (m1 + 2 * EB_PAGE_SIZE) + n1 ≤ PEB_SIZE, n2 + n1 ≤ # buf0, err1 = ESUCCESS → subarray(buf3, n2, n1) = subarray(buf2, m1 + 2 * EB_PAGE_SIZE, n1), err1 = ESUCCESS ∨ ⌊err1⌋ ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; bitflips := ?; if err = ESUCCESS then buf0 := copy(apebs[m3].data, m1, buf0, n2, n1) else choose buf with # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n2) ∧ range=(buf, n2 + n1, buf0, n2 + n1, # buf0 - n2 + n1) in buf0 := buf⟩ (buf3 = buf0 ∧ (bitflips0 ↔ bitflips) ∧ err1 = err)

User applied rule exists right

And obtained the following new goals

Proof step 22:
# buf3 = # buf0, # buf0 = n3 + n2 + n1, apebs[m3] = mkpeb(aehdr, avhdr, buf1, m2, false), pebs[m3] = mkpeb(buf2, m4, false), m3 < # pebs, m3 < # apebs, abs(pebs, apebs), abs-peb(mkpeb(buf2, m4, false), mkpeb(aehdr, avhdr, buf1, m2, false)), mtd-cons(pebs), range=(buf3, 0, buf0, 0, n2), range=(buf3, n2 + n1, buf0, n2 + n1, n3), ubi-io-inv(apebs), n2 + n1 ≤ # buf0, (m1 + 2 * EB_PAGE_SIZE) + n1 ≤ PEB_SIZE, m1 + n1 ≤ LEB_SIZE, err1 = ESUCCESS → subarray(buf3, n2, n1) = subarray(buf2, m1 + 2 * EB_PAGE_SIZE, n1), err1 = ESUCCESS ∨ ⌊err1⌋ ⊦ (⌊err1⌋ ∨ err1 = ESUCCESS) ∧ ⟨err := err1; bitflips := ?; if err = ESUCCESS then buf0 := copy(apebs[m3].data, m1, buf0, n2, n1) else choose buf with # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n2) ∧ range=(buf, n2 + n1, buf0, n2 + n1, # buf0 - n2 + n1) in buf0 := buf⟩ (buf3 = buf0 ∧ (bitflips0 ↔ bitflips) ∧ err1 = err)

Rule argument

pos: right 1 terms: err1 abort: F discard: T computed: T

Additional information

Used terms: err1