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

wlar[n1] = wl-entry(m1, stat0), wlar[n2] = wl-entry(m0, stat), n = n0, vtblpnum0 = vtblpnum, vtblpnum1 = EB_PAGE_SIZE, vtblpnum2 = n2, vtblpnum3 = m2, wlar0 = wlar, n1 < # wlar, n2 < # wlar, v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum = n1 ⊦ [ubi_next_sqnum#(; sqnum; m); let avhdr = avidhdr(v, vtblpnum3, m, datasize(buf, n), 0) in {n := datasize(buf, n); if n ≠ 0 then avhdr.checksum := checksum(buf, n); aubi_io_write_vidhdr#(vtblpnum2, avhdr; apebs; err); if err = ESUCCESS then if n > 0 then aubi_io_write_data_wl#(vtblpnum2, align↑(n, vtblpnum1), buf; apebs; err); if err = ESUCCESS then {if v = VTBL_VOLID ∧ vtblpnum3 = VTBL_LNUM then {ubi_wl_put_peb#(VTBL_VOLID × VTBL_LNUM, vtblpnum0; wlar, q); bflipset := bflipset -- vtblpnum0; vtblpnum0 := vtblpnum2} else {if vols[v][vtblpnum3] ≠ unmapped then let vtblpnum = vols[v][vtblpnum3].pnum in {ubi_wl_put_peb#(v × vtblpnum3, vtblpnum; wlar, q); bflipset := bflipset -- vtblpnum}; vols[v][vtblpnum3] := ⌜vtblpnum2⌝ }; wlar[vtblpnum2].status := 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 12:
wlar[n2] = wl-entry(m0, stat), wlar[n1] = wl-entry(m1, stat0), n2 ≠ n1, n2 < # wlar, n1 < # wlar, v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum = n1 ⊦ [ubi_next_sqnum#(; sqnum; m); let avhdr = avidhdr(v, m2, m, datasize(buf, n), 0) in {n := datasize(buf, n); if n ≠ 0 then avhdr.checksum := checksum(buf, n); aubi_io_write_vidhdr#(n2, avhdr; apebs; err); vtblpnum2 := n2; if err = ESUCCESS then if n ≠ 0 then aubi_io_write_data_wl#(vtblpnum2, align↑(n, EB_PAGE_SIZE), buf; apebs; err); wlar0 := wlar; if err = ESUCCESS then {if v = VTBL_VOLID ∧ m2 = VTBL_LNUM then {ubi_wl_put_peb#(VTBL_VOLID × VTBL_LNUM, vtblpnum; wlar, q); bflipset := bflipset -- vtblpnum; vtblpnum := 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: ⊦ wle.status:= stat = wl-entry(wle.ec, stat); (s)% ⊦ 0 < m ↔ m ≠ 0; (s)% ⊦ m > n ↔ n < m; (s)