[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 122 from proof delta-atomic-leb-change (previous step)

0 = datasize(buf, n), wlar[n2] = wl-entry(m0, stat), wlar[n1] = wl-entry(m1, stat0), avhdr = avidhdr(v, m2, sqnum, 0, 0), vtblpnum = n2, n2 < # wlar, n1 < # wlar, ubi-io-write-vidhdr-pre(vtblpnum, avhdr, apebs), v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum1 = n1 ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then apebs[vtblpnum].vidhdr := avhdr else choose avhdr with ¬ avhdr.valid? in apebs[vtblpnum].vidhdr := avhdr; vtblpnum2 := n2; if err = ESUCCESS then skip; wlar0 := wlar; if err = ESUCCESS then {if v = VTBL_VOLID ∧ m2 = VTBL_LNUM then {ubi_wl_put_peb#(VTBL_VOLID × VTBL_LNUM, vtblpnum1; wlar, q); bflipset := bflipset -- vtblpnum1; vtblpnum1 := vtblpnum2} else {if vols[v][m2] ≠ unmapped then let vtblpnum0 = vols[v][m2].pnum in {ubi_wl_put_peb#(v × m2, vtblpnum0; wlar, q); bflipset := bflipset -- vtblpnum0}; vols[v][m2] := ⌜vtblpnum2⌝ }; wlar[vtblpnum2] := wl-entry(wlar[vtblpnum2].ec, used)} else ubi_wl_put_peb#(none, vtblpnum2; wlar, q)] ( sum-of-differences(ecs(wlar).max, ecs(wlar)) = sum-of-differences(ecs(wlar0).max, ecs(wlar0)) ∧ ecs(wlar) = ecs(wlar0) ∧ (err = ESUCCESS → wlar[n2].ec = m0 ∧ wlar[n1].ec = m1)), n2 = n1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 123:
apebs[n2].vidhdr = empty, 0 = datasize(buf, n), wlar[n2] = wl-entry(m0, stat), wlar[n1] = wl-entry(m1, stat0), n2 ≠ n1, apebs[n2].echdr.valid?, n2 < # apebs, n2 < # wlar, n1 < # wlar, ¬ apebs[n2].bad, v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum1 = n1 ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then apebs[n2].vidhdr := avidhdr(v, m2, sqnum, 0, 0) else {vtblpnum := n2; choose avhdr with ¬ avhdr.valid? in apebs[vtblpnum].vidhdr := avhdr}; vtblpnum2 := n2; if err = ESUCCESS then skip; wlar0 := wlar; if err = ESUCCESS then {if v = VTBL_VOLID ∧ m2 = VTBL_LNUM then {ubi_wl_put_peb#(VTBL_VOLID × VTBL_LNUM, vtblpnum1; wlar, q); bflipset := bflipset -- vtblpnum1; vtblpnum1 := vtblpnum2} else {if vols[v][m2] ≠ unmapped then let vtblpnum0 = vols[v][m2].pnum in {ubi_wl_put_peb#(v × m2, vtblpnum0; wlar, q); bflipset := bflipset -- vtblpnum0}; vols[v][m2] := ⌜vtblpnum2⌝ }; wlar[vtblpnum2] := wl-entry(wlar[vtblpnum2].ec, used)} else ubi_wl_put_peb#(none, vtblpnum2; wlar, q)] ( sum-of-differences(ecs(wlar).max, ecs(wlar)) = sum-of-differences(ecs(wlar0).max, ecs(wlar0)) ∧ ecs(wlar) = ecs(wlar0) ∧ (err = ESUCCESS → wlar[n2].ec = m0 ∧ wlar[n1].ec = m1))

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ avidhdr(v, m, m0, m1, m2).valid?; (s)%⊦ ubi-io-write-vidhdr-pre(n, avhdr, apebs) ↔ n < # apebs ∧ ¬ apebs[n].bad ∧ avhdr.valid? ∧ apebs[n].echdr.valid? ∧ apebs[n].vidhdr = empty; (s)