[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 3 from proof refine-unmap (previous step)

# apebs = # wlar, vtblpnum < # avols[v], abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum0), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum0), valid-wl(apebs, wlar), v ∈ avols, ¬ VTBL_VOLID ∈ vols ⊦ ⟪ubi_unmap#(v, vtblpnum; vols, wlar, q, bflipset)⟫ ⟨ebm_unmap#(v, vtblpnum; avols)⟩ abs(avols, apebs, vols, q)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 4:
# apebs = # wlar, vtblpnum0 = vtblpnum, vtblpnum < # avols[v], abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum1), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum1), valid-wl(apebs, wlar), v ∈ avols ⊦ ⟪if v ∈ vols ∧ vtblpnum0 < # vols[v] then let ebae = vols[v][vtblpnum0] in if ebae ≠ unmapped then let vtblpnum = ebae.pnum in {vols[v][vtblpnum0] := unmapped; bflipset := bflipset -- vtblpnum; ubi_wl_put_peb#(v × vtblpnum0, vtblpnum; wlar, q)} else abort⟫ ⟨ebm_unmap#(v, vtblpnum; avols)⟩ abs(avols, apebs, vols, q), VTBL_VOLID ∈ vols

Rule argument

pos: right 1

Additional information

Used simplifier rules: ubi_unmap#(VOLID, LNUM; VOLS, WLARRAY, ERASEQ, BFLIPSET) {if VOLID ∈ VOLS ∧ LNUM < # VOLS[VOLID] then let EBAENT = VOLS[VOLID][LNUM] in if EBAENT ≠ unmapped then let PNUM = EBAENT.pnum in {VOLS[VOLID][LNUM] := unmapped; BFLIPSET := BFLIPSET -- PNUM; ubi_wl_put_peb#(VOLID × LNUM, PNUM; WLARRAY, ERASEQ)} else abort };