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

apebs[m1] = mkpeb(aehdr, avhdr, buf0, 0, false), m = EB_PAGE_SIZE, m0 = m1, n = align↑(datasize(buf, n), EB_PAGE_SIZE), aehdr.valid?, avhdr.valid?, m1 < # apebs, abs(pebs, apebs), mtd-cons(pebs), ubi-io-inv(apebs), n ≤ LEB_SIZE, n ≤ # buf ⊦ ⟪if m0 < # pebs ∧ ¬ pebs[m0].bad ∧ pebs[m0].fill = 2 * EB_PAGE_SIZE ∧ n ≤ LEB_SIZE ∧ n ≤ # buf ∧ is-aligned(n, EB_PAGE_SIZE) then mtd_asm_write#(m0, 2 * m, 0, n, buf; pebs; err) else abort⟫ ⟨aubi_io_write_data_wl#(m1, n, buf; apebs; err0)⟩ (abs(pebs, apebs) ∧ err = err0), datasize(buf, n) = 0

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 7:
pebs[m0].fill = 2 * EB_PAGE_SIZE, apebs[m1] = mkpeb(aehdr, avhdr, buf0, 0, false), m = EB_PAGE_SIZE, m0 = m1, n = align↑(datasize(buf, n), EB_PAGE_SIZE), avhdr.valid?, aehdr.valid?, m0 < # pebs, m1 < # apebs, abs(pebs, apebs), is-aligned(n, EB_PAGE_SIZE), mtd-cons(pebs), ubi-io-inv(apebs), n ≤ # buf, n ≤ LEB_SIZE, m0 < # pebs → m0 < # pebs ∧ (¬ pebs[m0].bad → m0 < # pebs) ⊦ ⟪mtd_asm_write#(m0, 2 * m, 0, n, buf; pebs; err)⟫ ⟨aubi_io_write_data_wl#(m1, n, buf; apebs; err0)⟩ (abs(pebs, apebs) ∧ err = err0), datasize(buf, n) = 0, pebs[m0].bad
Proof step 185:
apebs[m1] = mkpeb(aehdr, avhdr, buf0, 0, false), m = EB_PAGE_SIZE, m0 = m1, n = align↑(datasize(buf, n), EB_PAGE_SIZE), avhdr.valid?, aehdr.valid?, m1 < # apebs, abs(pebs, apebs), mtd-cons(pebs), ubi-io-inv(apebs), n ≤ # buf, n ≤ LEB_SIZE, m0 < # pebs → m0 < # pebs ∧ (¬ pebs[m0].bad → m0 < # pebs) ⊦ ⟪abort⟫ ⟨aubi_io_write_data_wl#(m1, n, buf; apebs; err0)⟩ (abs(pebs, apebs) ∧ err = err0), datasize(buf, n) = 0, m0 < # pebs ∧ ¬ pebs[m0].bad ∧ pebs[m0].fill = 2 * EB_PAGE_SIZE ∧ n ≤ LEB_SIZE ∧ n ≤ # buf ∧ is-aligned(n, EB_PAGE_SIZE)
Proof step 190:
apebs[m1] = mkpeb(aehdr, avhdr, buf0, 0, false), m = EB_PAGE_SIZE, m0 = m1, n = align↑(datasize(buf, n), EB_PAGE_SIZE), avhdr.valid?, aehdr.valid?, m0 < # pebs, m1 < # apebs, abs(pebs, apebs), mtd-cons(pebs), ubi-io-inv(apebs), n ≤ # buf, n ≤ LEB_SIZE ⊦ datasize(buf, n) = 0, m0 < # pebs ∧ (¬ pebs[m0].bad → m0 < # pebs)

Rule argument

pos: right 1

Proof step 6 from proof refine-write-data-wl (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information