| apebs[n] = mkpeb(aehdr, avhdr, buf0, m, false), apebs0 = apebs, n0 = n4, n2 = n5, n3 = n, avhdr.valid?, aehdr.valid?, n < # apebs, is-aligned(n4, EB_PAGE_SIZE), is-aligned(n5, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-write-data-pre(n3, n2, n1, n0, buf, apebs), n1 + n4 ≤ # buf, n5 + n4 ≤ LEB_SIZE, m ≤ n5 ⊦ ⟨fail_or_success#(; ; err); if err = ESUCCESS then apebs[n3] := mkpeb (apebs[n3].echdr, apebs[n3].vidhdr, subarray(apebs[n3].data, 0, n2) + subarray(buf, n1, n0) + mkempbuf(LEB_SIZE - n2 - n0), n2 + n0, apebs[n3].bad) else choose n with (n < n0 ∨ n = 0 ∧ n0 = 0) ∧ is-aligned(n, EB_PAGE_SIZE) in if n ≠ 0 then apebs[n3] := mkpeb (apebs[n3].echdr, apebs[n3].vidhdr, subarray(apebs[n3].data, 0, n2) + subarray(buf, n1, n) + mkempbuf(LEB_SIZE - n2 - n), n2 + n, apebs[n3].bad)⟩ (apebs0 = apebs) |
apebs[n] = mkpeb(aehdr, avhdr, buf0, m, false), avhdr.valid?, aehdr.valid?, n < # apebs, is-aligned(n4, EB_PAGE_SIZE), is-aligned(n5, EB_PAGE_SIZE), ubi-io-inv(apebs), n1 + n4 ≤ # buf, n5 + n4 ≤ LEB_SIZE, m ≤ n5 ⊦ ⟨fail_or_success#(; ; err); apebs0 := apebs; if err = ESUCCESS then apebs[n] := mkpeb (apebs[n].echdr, apebs[n].vidhdr, subarray(apebs[n].data, 0, n5) + subarray(buf, n1, n4) + mkempbuf(LEB_SIZE - n5 - n4), n5 + n4, apebs[n].bad) else choose n2 with (n2 < n4 ∨ n2 = 0 ∧ n4 = 0) ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then apebs[n] := mkpeb (apebs[n].echdr, apebs[n].vidhdr, subarray(apebs[n].data, 0, n5) + subarray(buf, n1, n2) + mkempbuf(LEB_SIZE - n5 - n2), n5 + n2, apebs[n].bad)⟩ (apebs0 = apebs)
Used simplifier rules: ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).bad ↔ boolvar; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).echdr = aehdr; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).vidhdr = avhdr; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).fill = m; (s)%⊦ ubi-io-write-data-pre(n, n0, n1, n2, buf, apebs) ↔ n < # apebs ∧ ¬ apebs[n].bad ∧ apebs[n].echdr.valid? ∧ apebs[n].vidhdr.valid? ∧ is-aligned(n0, EB_PAGE_SIZE) ∧ is-aligned(n2, EB_PAGE_SIZE) ∧ apebs[n].fill ≤ n0 ∧ n0 + n2 ≤ LEB_SIZE ∧ n1 + n2 ≤ # buf; (s)