| n0 + # buf1 = align↑(datasize(buf, n0 + # buf1), EB_PAGE_SIZE), LEB_SIZE = n1 + # buf1, apebs[n2] = mkpeb(aehdr, avhdr, buf0, 0, false), aehdr.valid?, avhdr.valid?, n2 < # apebs, is-aligned(# buf1, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf0, 0, false)), n0 + # buf1 ≤ LEB_SIZE, n0 + # buf1 ≤ # buf, # buf1 ≤ LEB_SIZE, # buf1 ≤ # buf, ⌊err0⌋ , datasize(buf1, # buf1) < datasize(buf, n0 + # buf1) ∨ checksum(buf1 + mkempbuf(n0), datasize(buf, n0 + # buf1)) ≠ checksum(buf, datasize(buf, n0 + # buf1)) ⊦ datasize(buf, n0 + # buf1) = 0, (aehdr = empty → avhdr = empty) ∧ (aehdr ≠ garbage ∧ avhdr = empty → # buf1 = 0) ∧ subarray(mkempbuf(n1), 0, LEB_SIZE - # buf1) = mkempbuf(LEB_SIZE - # buf1) |
n0 + # buf1 = align↑(datasize(buf, n0 + # buf1), EB_PAGE_SIZE), LEB_SIZE = n1 + # buf1, LEB_SIZE = n3 + # buf1, apebs[n2] = mkpeb(aehdr, avhdr, buf0, 0, false), avhdr.valid?, aehdr.valid?, n2 < # apebs, is-aligned(# buf1, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf0, 0, false)), # buf1 ≤ # buf, # buf1 ≤ LEB_SIZE, n0 + # buf1 ≤ # buf, n0 + # buf1 ≤ LEB_SIZE, ⌊err0⌋ , datasize(buf1, # buf1) < datasize(buf, n0 + # buf1) ∨ checksum(buf1 + mkempbuf(n0), datasize(buf, n0 + # buf1)) ≠ checksum(buf, datasize(buf, n0 + # buf1)) ⊦ datasize(buf, n0 + # buf1) = 0, (aehdr = empty → avhdr = empty) ∧ (aehdr ≠ garbage ∧ avhdr = empty → # buf1 = 0) ∧ subarray(mkempbuf(n1), 0, n3) = mkempbuf(n3)
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: LEB_SIZE, # buf1, n