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

apebs[m3] = mkpeb(aehdr, avhdr, buf0, m2, false), pebs[m3] = mkpeb(buf1, 2 * EB_PAGE_SIZE + m2, false), n3 ≠ 0, avhdr.valid?, aehdr.valid?, n3 < n, m3 < # apebs, m3 < # pebs, abs(pebs, apebs), abs-peb(mkpeb(buf1, 2 * EB_PAGE_SIZE + m2, false), mkpeb(aehdr, avhdr, buf0, m2, false)), is-aligned(m1, EB_PAGE_SIZE), is-aligned(n, EB_PAGE_SIZE), is-aligned(n3, EB_PAGE_SIZE), mtd-cons(pebs), ubi-io-inv(apebs), n2 + n3 ≤ # buf, m1 + n ≤ LEB_SIZE, n2 + n ≤ # buf, (m1 + 2 * EB_PAGE_SIZE) + n3 ≤ PEB_SIZE, m2 ≤ m1, ⌊err0⌋ ⊦ ⟨fail_or_success#(; ; err); if err = ESUCCESS then apebs[m3] := mkpeb (apebs[m3].echdr, apebs[m3].vidhdr, subarray(apebs[m3].data, 0, m1) + subarray(buf, n2, n) + mkempbuf(LEB_SIZE - m1 - n), m1 + n, apebs[m3].bad) else {n1 := n2; m0 := m3; m := m1; choose n2 with (n2 < n ∨ n2 = 0 ∧ n = 0) ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then apebs[m0] := mkpeb (apebs[m0].echdr, apebs[m0].vidhdr, subarray(apebs[m0].data, 0, m) + subarray(buf, n1, n2) + mkempbuf(LEB_SIZE - m - n2), m + n2, apebs[m0].bad)}⟩ ( abs(pebs[m3, (pebs[m3].data:= copy(buf, n2, pebs[m3].data, m1 + 2 * EB_PAGE_SIZE, n3)).fill:= ((m1 + 2 * EB_PAGE_SIZE) + n3)], apebs) ∧ err0 = err)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 90:
pebs[m3] = mkpeb(buf1, 2 * EB_PAGE_SIZE + m2, false), apebs[m3] = mkpeb(aehdr, avhdr, buf0, m2, false), aehdr.valid?, avhdr.valid?, m3 < # pebs, m3 < # apebs, n3 < n, abs(pebs, apebs), abs-peb(mkpeb(buf1, 2 * EB_PAGE_SIZE + m2, false), mkpeb(aehdr, avhdr, buf0, m2, false)), is-aligned(n3, EB_PAGE_SIZE), is-aligned(n, EB_PAGE_SIZE), is-aligned(m1, EB_PAGE_SIZE), mtd-cons(pebs), ubi-io-inv(apebs), m2 ≤ m1, (m1 + 2 * EB_PAGE_SIZE) + n3 ≤ PEB_SIZE, n2 + n ≤ # buf, m1 + n ≤ LEB_SIZE, n2 + n3 ≤ # buf, ⌊err0⌋ ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then apebs[m3] := mkpeb (apebs[m3].echdr, apebs[m3].vidhdr, subarray(apebs[m3].data, 0, m1) + subarray(buf, n2, n) + mkempbuf(LEB_SIZE - m1 - n), m1 + n, apebs[m3].bad) else {n1 := n2; m0 := m3; m := m1; choose n2 with (n2 < n ∨ n2 = 0 ∧ n = 0) ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then apebs[m0] := mkpeb (apebs[m0].echdr, apebs[m0].vidhdr, subarray(apebs[m0].data, 0, m) + subarray(buf, n1, n2) + mkempbuf(LEB_SIZE - m - n2), m + n2, apebs[m0].bad)}⟩ ( abs(pebs[m3, (pebs[m3].data:= copy(buf, n2, pebs[m3].data, m1 + 2 * EB_PAGE_SIZE, n3)).fill:= ((m1 + 2 * EB_PAGE_SIZE) + n3)], apebs) ∧ err0 = err), n3 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};