[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 390 from proof prepost-scan-all (previous step)

# apebs = n0 + vtblpnum, # wlar0 = n0 + vtblpnum, avhdr.size = 0, apebs[vtblpnum] = mkpeb(aechdr(m), avhdr1, buf1, m0, false), avhdr = apebs[vtblpnum].vidhdr, ¬ bitflips, buf = mkbuf(LEB_SIZE), err = err0, err = ESUCCESS, ladr = avhdr.vol × avhdr.leb, n = 0, vtblpnum0 = recs[ladr].pnum, wlar = wlar1[vtblpnum, wl-entry(wlar1[vtblpnum].ec, used)], wlar1 = wlar0[vtblpnum, wlar0[vtblpnum].ec:= m], apebs[vtblpnum].vidhdr.valid?, avhdr.valid?, vtblpnum0 < # wlar, vtblpnum < # wlar0, nx < vtblpnum, vtblpnum < # apebs, vtblpnum < # wlar1, bflipset-cons(bflipset, subarray(wlar0, 0, vtblpnum)), indices-erasing(wlar0, nx), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aechdr(m), avhdr1, buf1, m0, false)), unique-sqns(apebs), valid-eraseq(subarray(wlar0, 0, vtblpnum), q), valid-eraseq-stronger(subarray(apebs, 0, vtblpnum), q), valid-global-sqn(subarray(apebs, 0, vtblpnum), sqnum), valid-recs(subarray(apebs, 0, vtblpnum), subarray(wlar0, 0, vtblpnum), recs), valid-recs-sqns(apebs, recs), valid-wl(subarray(apebs, 0, vtblpnum), subarray(wlar0, 0, vtblpnum)), ladr ∈ recs, recs[ladr].sqn ≤ avhdr.sqn, avhdr.size ≠ 0 → avhdr.valid? ∧ (avhdr.size ≤ datasize(buf) → avhdr.valid? ∧ avhdr.valid?), avhdr.size ≠ 0 → avhdr.size ≤ datasize(buf) ∧ avhdr.checksum = checksum(buf, avhdr.size), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪q := q + eq-entry(vtblpnum0, avhdr.vol × avhdr.leb) '; recs[ladr] := recovery-entry(vtblpnum, avhdr.sqn); vtblpnum := vtblpnum + 1⟫ ( vtblpnum ≤ # apebs ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → # apebs = # wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)] ∧ nx < vtblpnum ∧ indices-erasing(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], nx) ∧ valid-global-sqn(subarray(apebs, 0, vtblpnum), max(sqnum, avhdr.sqn + 1)) ∧ valid-eraseq(subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum), q) ∧ bflipset-cons(bflipset -- vtblpnum0, subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum)) ∧ valid-eraseq-stronger(subarray(apebs, 0, vtblpnum), q) ∧ valid-wl(subarray(apebs, 0, vtblpnum), subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum)) ∧ valid-recs-sqns(apebs, recs) ∧ valid-recs(subarray(apebs, 0, vtblpnum), subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum), recs)) ∧ # apebs < n0 + vtblpnum), apebs[vtblpnum].vidhdr = empty, n0 = 0, dups(nx)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 391:
# wlar0 = n0 + vtblpnum, # apebs = n0 + vtblpnum, avhdr.size = 0, apebs[vtblpnum] = mkpeb(aechdr(m), avhdr1, buf1, m0, false), avhdr = apebs[vtblpnum].vidhdr, ¬ bitflips, buf = mkbuf(LEB_SIZE), err = ESUCCESS, err = err0, ladr = avhdr.vol × avhdr.leb, n = 0, vtblpnum0 = recs[ladr].pnum, wlar = wlar1[vtblpnum, wl-entry(wlar1[vtblpnum].ec, used)], wlar1 = wlar0[vtblpnum, wlar0[vtblpnum].ec:= m], avhdr.valid?, apebs[vtblpnum].vidhdr.valid?, vtblpnum < # wlar1, vtblpnum < # apebs, nx < vtblpnum, vtblpnum < # wlar0, vtblpnum0 < # wlar, bflipset-cons(bflipset, subarray(wlar0, 0, vtblpnum)), indices-erasing(wlar0, nx), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aechdr(m), avhdr1, buf1, m0, false)), unique-sqns(apebs), valid-eraseq(subarray(wlar0, 0, vtblpnum), q), valid-eraseq-stronger(subarray(apebs, 0, vtblpnum), q), valid-global-sqn(subarray(apebs, 0, vtblpnum), sqnum), valid-recs(subarray(apebs, 0, vtblpnum), subarray(wlar0, 0, vtblpnum), recs), valid-recs-sqns(apebs, recs), valid-wl(subarray(apebs, 0, vtblpnum), subarray(wlar0, 0, vtblpnum)), ladr ∈ recs, recs[ladr].sqn ≤ avhdr.sqn, avhdr.size ≠ 0 → avhdr.size ≤ datasize(buf) ∧ avhdr.checksum = checksum(buf, avhdr.size), avhdr.size ≠ 0 → avhdr.valid? ∧ (avhdr.size ≤ datasize(buf) → avhdr.valid? ∧ avhdr.valid?), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪recs[ladr] := recovery-entry(vtblpnum, avhdr.sqn); vtblpnum := vtblpnum + 1⟫ ( vtblpnum ≤ # apebs ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → # apebs = # wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)] ∧ nx < vtblpnum ∧ indices-erasing(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], nx) ∧ valid-global-sqn(subarray(apebs, 0, vtblpnum), max(sqnum, avhdr.sqn + 1)) ∧ valid-eraseq (subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum), q + eq-entry(vtblpnum0, avhdr.vol × avhdr.leb) ') ∧ bflipset-cons(bflipset -- vtblpnum0, subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum)) ∧ valid-eraseq-stronger(subarray(apebs, 0, vtblpnum), q + eq-entry(vtblpnum0, avhdr.vol × avhdr.leb) ') ∧ valid-wl(subarray(apebs, 0, vtblpnum), subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum)) ∧ valid-recs-sqns(apebs, recs) ∧ valid-recs(subarray(apebs, 0, vtblpnum), subarray(wlar[vtblpnum0, wl-entry(wlar[vtblpnum0].ec, erasing)], 0, vtblpnum), recs)) ∧ # apebs < n0 + vtblpnum), apebs[vtblpnum].vidhdr = empty, n0 = 0, dups(nx)

Rule argument

Additional information

Used simplifier rules: ⊦ m < # wlar → wlar[m, wle][m] = wle; (s)% ⊦ (wle.ec:= m).ec = m; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m + m0 ≤ m ↔ m0 = 0; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic%m < # wlar ⊦ wlar[m, wle][m, wle0] = wlar[m, wle0]; (s)% ⊦ # wlar[n, wle] = # wlar; (s)% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)