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

# apebs0 = # wlar, LEB_SIZE = (n0 + n2) + vtblpnum5, vols[v][vtblpnum3] = ⌜n4⌝ , avols[v][vtblpnum3] = mapped(buf2, m), wlar[n4] = wl-entry(m1, used), apebs0[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), n2 ≠ 0, vtblpnum4 ≠ n4, aehdr.valid?, avhdr.valid?, n4 < # wlar, vtblpnum3 < # vols[v], vtblpnum3 < # avols[v], n2 < n, abs(avols, apebs0, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(vtblpnum5, EB_PAGE_SIZE), is-aligned(n, EB_PAGE_SIZE), is-aligned(n2, EB_PAGE_SIZE), ubi-io-inv(apebs0), ubi-io-inv(apebs0[n4, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false)]), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs0), unique-sqns(apebs0[n4, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false)]), valid-ebatbl(apebs0, wlar, vols, vtblpnum4), valid-ebatbl (apebs0[n4, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false)], wlar, vols, vtblpnum4), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs0, q), valid-eraseq(apebs0[n4, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false)], q), valid-global-sqn(apebs0, sqnum), valid-global-sqn(apebs0[n4, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false)], sqnum), valid-vtbl(apebs0, vols, wlar, vtblpnum4), valid-wl(apebs0, wlar), valid-wl(apebs0[n4, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false)], wlar), v ∈ vols, v ∈ avols, vtblpnum5 + n ≤ LEB_SIZE, n3 + n ≤ # buf, n + n3 ≤ # buf, m ≤ vtblpnum5, m0 ≤ vtblpnum5, vtblpnum5 ≤ LEB_SIZE, n2 + vtblpnum5 ≤ LEB_SIZE, n3 + n2 ≤ # buf, m ≤ LEB_SIZE, m0 ≤ LEB_SIZE, ⌊err0⌋ , ¬ VTBL_VOLID ∈ vols ⊦ ⟪debug#("ubi: failed to write to PEB " + vols[v][vtblpnum3].pnum.toString); let buf1 = mkbuf(vtblpnum5 + n), bitflips = ? in {aubi_io_read_data# (vols[v][vtblpnum3].pnum, 0, 0, vtblpnum5, apebs0 [vols[v][vtblpnum3].pnum, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false) ] ; buf1 ; bitflips, err0); apebs := apebs0 [vols[v][vtblpnum3].pnum, mkpeb(aehdr, avhdr, subarray(buf2, 0, vtblpnum5) + subarray(buf, n3, n2) + mkempbuf(n0), vtblpnum5 + n2, false) ]; if err0 = ESUCCESS then {buf1 := copy(buf, n3, buf1, vtblpnum5, n); debug#("ubi: moving data from PEB " + vols[v][vtblpnum3].pnum.toString); ubi_change#(v, vtblpnum3, vtblpnum5 + n, buf1, EB_PAGE_SIZE; vols, wlar, q, bflipset, vtblpnum4, sqnum, apebs; err0)} else debug#("ubi: failed to read data from PEB " + vols[v][vtblpnum3].pnum.toString)}⟫ ⟨ebm_write#(v, vtblpnum3, vtblpnum5, n3, n, buf; avols; err1)⟩ (abs(avols, apebs, vols, q) ∧ err0 = err1)

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → [ "ubi: failed to write to PEB " + vols[v][vtblpnum3].pnum.toString] flags: <all paths>

Additional information

Used simplifier rules: ⊦ v ∈ avols ∧ m < # avols[v] ∧ abs(avols, apebs, vols, q) → m < # vols[v]; (ss)% ⊦ v ∈ avols ∧ abs(avols, apebs, vols, q) → v ∈ vols; (ss)%abs-vols-unmapped: ⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = unmapped ∧ abs(avols, apebs, vols, q) → ¬ avols[v][m].mapped?; (forward) from specification ubi-abs% ⊦ unmapped ≠ ⌜m⌝ ; (s)