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

# wlar0 = n1 + vtblpnum1, # apebs = n1 + vtblpnum1, apebs[vtblpnum1] = mkpeb(aechdr(m), avidhdr(v, m1, m2, m3, m4), buf1, m0, false), buf = mkbuf(LEB_SIZE), err = err0, err = ESUCCESS, ladr = apebs[vtblpnum1].vidhdr.vol × apebs[vtblpnum1].vidhdr.leb, n = 0, wlar = wlar0[vtblpnum1, wlar0[vtblpnum1].ec:= m], apebs[vtblpnum1].vidhdr.valid?, vtblpnum1 < # wlar, vtblpnum1 < # apebs, nx < vtblpnum1, vtblpnum1 < # wlar0, bflipset-cons(bflipset, subarray(wlar0, 0, vtblpnum1)), indices-erasing(wlar0, nx), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aechdr(m), avidhdr(v, m1, m2, m3, m4), buf1, m0, false)), unique-sqns(apebs), valid-eraseq(subarray(wlar0, 0, vtblpnum1), q), valid-eraseq-stronger(subarray(apebs, 0, vtblpnum1), q), valid-global-sqn(subarray(apebs, 0, vtblpnum1), sqnum), valid-recs(subarray(apebs, 0, vtblpnum1), subarray(wlar0, 0, vtblpnum1), recs), valid-recs-sqns(apebs, recs), valid-wl(subarray(apebs, 0, vtblpnum1), subarray(wlar0, 0, vtblpnum1)), ladr ∈ recs, 0 + LEB_SIZE ≤ # apebs[vtblpnum1].data, 0 + LEB_SIZE ≤ # buf, apebs[vtblpnum1].vidhdr.size ≠ 0 → ( (apebs[vtblpnum1].vidhdr.valid? ∧ vtblpnum1 < # apebs) ∧ (0 + LEB_SIZE ≤ # apebs[vtblpnum1].data ∧ 0 + LEB_SIZE ≤ # buf) ∧ vtblpnum1 < # apebs) ∧ ( apebs[vtblpnum1].vidhdr.size ≤ datasize(copy(apebs[vtblpnum1].data, 0, buf, 0, LEB_SIZE)) → (apebs[vtblpnum1].vidhdr.valid? ∧ vtblpnum1 < # apebs) ∧ ((0 + LEB_SIZE ≤ # apebs[vtblpnum1].data ∧ 0 + LEB_SIZE ≤ # buf) ∧ vtblpnum1 < # apebs) ∧ apebs[vtblpnum1].vidhdr.valid? ∧ vtblpnum1 < # apebs), apebs[vtblpnum1].vidhdr.size ≠ 0 → apebs[vtblpnum1].vidhdr.size ≤ datasize(copy(apebs[vtblpnum1].data, 0, buf, 0, LEB_SIZE)) ∧ apebs[vtblpnum1].vidhdr.checksum = checksum(copy(apebs[vtblpnum1].data, 0, buf, 0, LEB_SIZE), apebs[vtblpnum1].vidhdr.size), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ m3 = 0, n1 = 0, dups(nx), recs[ladr].sqn ≤ apebs[vtblpnum1].vidhdr.sqn, vtblpnum1 + 1 ≤ # apebs ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → # apebs = # wlar[vtblpnum1, wl-entry(wlar[vtblpnum1].ec, erasing)] ∧ nx < vtblpnum1 + 1 ∧ indices-erasing(wlar[vtblpnum1, wl-entry(wlar[vtblpnum1].ec, erasing)], nx) ∧ valid-global-sqn(subarray(apebs, 0, vtblpnum1 + 1), max(sqnum, apebs[vtblpnum1].vidhdr.sqn + 1)) ∧ valid-eraseq (subarray(wlar[vtblpnum1, wl-entry(wlar[vtblpnum1].ec, erasing)], 0, vtblpnum1 + 1), q + eq-entry(vtblpnum1, ladr.vol × ladr.leb) ') ∧ bflipset-cons(bflipset, subarray(wlar[vtblpnum1, wl-entry(wlar[vtblpnum1].ec, erasing)], 0, vtblpnum1 + 1)) ∧ valid-eraseq-stronger(subarray(apebs, 0, vtblpnum1 + 1), q + eq-entry(vtblpnum1, ladr.vol × ladr.leb) ') ∧ valid-wl(subarray(apebs, 0, vtblpnum1 + 1), subarray(wlar[vtblpnum1, wl-entry(wlar[vtblpnum1].ec, erasing)], 0, vtblpnum1 + 1)) ∧ valid-recs-sqns(apebs, recs) ∧ valid-recs(subarray(apebs, 0, vtblpnum1 + 1), subarray(wlar[vtblpnum1, wl-entry(wlar[vtblpnum1].ec, erasing)], 0, vtblpnum1 + 1), recs)) ∧ # apebs < n1 + vtblpnum1 + 1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ubi-io-inv-fwd: n < # apebs ⊦ apebs[n] = apeb ∧ ubi-io-inv(apebs) → ubi-io-peb-inv(apeb);%datasize-le-fwd: ⊦ m ≤ datasize(buf) → m ≤ # buf; (forward) from specification datasize% ⊦ ¬ n < n; (s)% ⊦ m + n < m + n0 ↔ n < n0; (s)% ⊦ avidhdr(v, m, m0, m1, m2).checksum = m2; (s)% ⊦ avidhdr(v, m, m0, m1, m2).size = m1; (s)% ⊦ avidhdr(v, m, m0, m1, m2).valid?; (s)% ⊦ m < n → n ≠ 0; (s)% ⊦ avidhdr(v, m, m0, m1, m2).sqn = m0; (s)% ⊦ avidhdr(v, m, m0, m1, m2).leb = m; (s)% ⊦ avidhdr(v, m, m0, m1, m2).vol = v; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).vidhdr = avhdr; (s)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ m < n + 1 ↔ ¬ n < m; (s)%m < # apebs, # wlar = # apebs, stat ≠ used ⊦ valid-recs(subarray(apebs, 0, m), subarray(wlar, 0, m), recs) → valid-recs (subarray(apebs, 0, m + 1), subarray(wlar[m, wl-entry(m0, stat)], 0, m + 1), recs); (ss)% ⊦ used ≠ erasing; (s)% ⊦ m < m + n ↔ n ≠ 0; (s)%n < # wlar ⊦ bflipset-cons(bflipset, subarray(wlar, 0, n)) → bflipset-cons(bflipset, subarray(wlar[n, wle], 0, n + 1)); (ss)%a: ⊦ (q + q0) + q1 = q + q0 + q1; from specification list[erasequeue-base]%m < # wlar ⊦ valid-eraseq(subarray(wlar, 0, m), q) → valid-eraseq (subarray(wlar[m, wl-entry(m0, erasing)], 0, m + 1), q + eq-entry(m, lref) '); (ss)% ⊦ (v × m).leb = m; (s)% ⊦ (v × m).vol = v; (s)%⊦ indices-erasing(wlar, nx) → indices-erasing(wlar[m, wl-entry(n, erasing)], nx); (ss)% ⊦ nx < m → nx < m + n; (ss)%m < # wlar ⊦ wlar[m, wle][m, wle0] = wlar[m, wle0]; (s)% ⊦ m + m0 ≤ m ↔ m0 = 0; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ (wle.ec:= m).ec = m; (s)% ⊦ m < # wlar → wlar[m, wle][m] = wle; (s)% ⊦ m + 1 ≤ n ↔ m < n; (s)%# buf = m, # buf0 = m ⊦ copy(buf, 0, buf0, 0, m) = buf; (s)%⊦ ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf, n, boolvar)) → # buf = LEB_SIZE; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).data = buf; (s)% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)% ⊦ # wlar[n, wle] = # wlar; (s)% ⊦ m ≤ m; (s)% ⊦ # mkbuf(n) = n; (s)%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ n + 0 = n; (s)