[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 190 from proof inv-format (previous step)

# wlar = # apebs1, apebs1[vtblpnum2] = mkpeb(aehdr, empty, buf0, m, false), apebs = apebs1, apebs0 = apebs[vtblpnum2, apebs[vtblpnum2].vidhdr:= avidhdr(VTBL_VOLID, VTBL_LNUM, 0, 0, 0)], err = err0, err = ESUCCESS, err1 = err, vtblpnum1 = LEB_SIZE, aehdr.valid?, vtblpnum2 < # apebs1, vtblpnum2 < # apebs, ubi-io-initial(apebs1), ubi-io-inv(apebs[vtblpnum2, apebs[vtblpnum2].vidhdr:= avidhdr(VTBL_VOLID, VTBL_LNUM, 0, 0, 0)]), ∀ n3. n3 < # apebs1 → (apebs1[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs1[n3].bad → apebs1[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs1[n3].echdr.ec, free) ∧ apebs1[n3].vidhdr = empty), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪let buf = mkbuf(vtblpnum1), vtbl = ∅ in {encode_vtbl#(; vtbl, buf; err1); if err1 = ESUCCESS then aubi_io_write_data#(vtblpnum2, 0, 0, vtblpnum1, buf; apebs0; err1)}; vols := ∅; wlar[vtblpnum2] := wl-entry(wlar[vtblpnum2].ec, used); q := []; sqnum := 1; bflipset := ∅⟫ ( ( err1 = ESUCCESS → # apebs0 = # wlar ∧ unique-sqns(apebs0) ∧ valid-global-sqn(apebs0, sqnum) ∧ valid-wl(apebs0, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs0, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs0, wlar, vols, vtblpnum2) ∧ valid-vtbl(apebs0, vols, wlar, vtblpnum2) ∧ vtblpnum1 = LEB_SIZE ∧ ubi-io-inv(apebs0)) ∧ (err1 = ESUCCESS ∨ ⌊err1⌋ ) ∧ (err1 = ESUCCESS → vols = ∅)), vtblpnum2 = # apebs1, vtblpnum1 < ENCODED_NAT_SIZE

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information