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

# wlar = n0 + vtblpnum, # apebs = n0 + vtblpnum, apebs[vtblpnum] = mkpeb(aehdr0, avhdr0, buf0, m, false), nx < vtblpnum, bflipset-cons(bflipset, subarray(wlar, 0, vtblpnum)), indices-erasing(wlar, nx), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr0, avhdr0, buf0, m, false)), unique-sqns(apebs), valid-eraseq(subarray(wlar, 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(wlar, 0, vtblpnum), recs), valid-recs-sqns(apebs, recs), valid-wl(subarray(apebs, 0, vtblpnum), subarray(wlar, 0, vtblpnum)) ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; bitflips := ?; if err = ESUCCESS then aehdr := apebs[vtblpnum].echdr else aehdr := ?; if err = ESUCCESS then if ¬ aehdr.valid? then {nx := vtblpnum ' + nx; wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, erasing); q := q + eq-entry(vtblpnum, none) '} else let avhdr = ? in {vtblpnum2 := vtblpnum2 + 1; vtblpnum1 := vtblpnum1 + aehdr.ec; wlar[vtblpnum].ec := aehdr.ec; aubi_io_read_vidhdr#(vtblpnum, apebs; avhdr; bitflips, err); if err = ESUCCESS then if avhdr = empty then if bitflips then {wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, erasing); q := q + eq-entry(vtblpnum, none) '} else wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, free) else if avhdr.valid? then let buf = mkbuf(LEB_SIZE) in {if avhdr.size ≠ 0 then let boolvar = ? in {aubi_io_read_data#(vtblpnum, 0, 0, LEB_SIZE, apebs; buf; boolvar, err); bitflips := bitflips ∨ boolvar}; if err = ESUCCESS then let ladr = avhdr.vol × avhdr.leb, n = 0 in {if ladr ∈ recs then n := recs[ladr].sqn; if avhdr.size ≠ 0 → avhdr.size ≤ datasize(buf) ∧ avhdr.checksum = checksum(buf, avhdr.size) then {sqnum := max(sqnum, avhdr.sqn + 1); if n ≤ avhdr.sqn then {wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, used); if bitflips then bflipset := bflipset ++ vtblpnum; if ladr ∈ recs then let vtblpnum0 = recs[ladr].pnum in {bflipset := bflipset -- vtblpnum0; wlar[vtblpnum0] := wl-entry(wlar[vtblpnum0].ec, erasing); q := q + eq-entry(vtblpnum0, avhdr.vol × avhdr.leb) '}; recs[ladr] := recovery-entry(vtblpnum, avhdr.sqn)} else {wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, erasing); q := q + eq-entry(vtblpnum, ladr.vol × ladr.leb) '}} else {wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, erasing); q := q + eq-entry(vtblpnum, none) '}}} else {wlar[vtblpnum] := wl-entry(wlar[vtblpnum].ec, erasing); q := q + eq-entry(vtblpnum, none) '}}; vtblpnum := vtblpnum + 1⟫ ( vtblpnum ≤ # apebs ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → # apebs = # wlar ∧ ¬ dups(nx) ∧ nx < vtblpnum ∧ indices-erasing(wlar, nx) ∧ valid-global-sqn(subarray(apebs, 0, vtblpnum), sqnum) ∧ valid-eraseq(subarray(wlar, 0, vtblpnum), q) ∧ bflipset-cons(bflipset, subarray(wlar, 0, vtblpnum)) ∧ valid-eraseq-stronger(subarray(apebs, 0, vtblpnum), q) ∧ valid-wl(subarray(apebs, 0, vtblpnum), subarray(wlar, 0, vtblpnum)) ∧ valid-recs-sqns(apebs, recs) ∧ valid-recs(subarray(apebs, 0, vtblpnum), subarray(wlar, 0, vtblpnum), recs)) ∧ # apebs < n0 + vtblpnum), n0 = 0, dups(nx)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information