| ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) |
dom gs.vrvHp = dom gs.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)
| dom gs.vrvHp = dom gs.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns) |
dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], r ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.ps, r ∈ gs.vs, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ (∃ rl. gs.qrl + rl = (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl)) ∧ gs.vtail ∈ gs.orl + (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl) from gs.vtail ∧ gs.vhead ∈ gs.orl + (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[r, gs.ps[r].next:= gs.vs[r].next], (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.owns(gs.vs[(gs.orl + gs.qrl).last].next; None);gs.owns)) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gs.orl + (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl), gs.vs) ∧ ownsRely (tid0, gs.owns, (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.owns(gs.vs[(gs.orl + gs.qrl).last].next; None);gs.owns))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ x + a = x + a '; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], r ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.ps, r ∈ gs.vs, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ (∃ rl. gs.qrl + rl = (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl)) ∧ gs.vtail ∈ gs.orl + (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl) from gs.vtail ∧ gs.vhead ∈ gs.orl + (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[r, gs.ps[r].next:= gs.vs[r].next], (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.owns(gs.vs[(gs.orl + gs.qrl).last].next; None);gs.owns)) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gs.orl + (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ';gs.qrl), gs.vs) ∧ ownsRely (tid0, gs.owns, (r = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.owns(gs.vs[(gs.orl + gs.qrl).last].next; None);gs.owns)) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns))
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
dom vrvHp = dom prvHp, r = (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns))
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)), r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used formulas: r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
| dom vrvHp = dom prvHp, r = (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail ∧ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail ∧ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None)) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, vtail = (orl + qrl).last, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, vtail = (orl + qrl).last, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl + vs[(orl + qrl).last].next ', (orl + qrl).last
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, qrl = vhead0 + qrl0, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vhead0, y
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, qrl = vhead0 + qrl0, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl + vs[(orl + qrl).last].next ' from (orl + qrl).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(vhead0 ' + qrl0).last].next].deqID = None, ps[vhead0].deqID = None, vs[vs[(vhead0 ' + qrl0).last].next].next = null, ps[vs[(vhead0 ' + qrl0).last].next] = vs[vs[(vhead0 ' + qrl0).last].next], dom vrvHp = dom prvHp, (vhead0 ' + qrl0).last ≠ null, vs[(vhead0 ' + qrl0).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vhead0 ' + qrl0).last].next)), (vhead0 ' + qrl0).last ∈ ps, (vhead0 ' + qrl0).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + qrl0).last].next ∈ ps, vs[(vhead0 ' + qrl0).last].next ∈ vs, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl, ¬ (vhead0 ' + qrl0).last ∈ orl, ¬ (vhead0 ' + qrl0).last ∈ (vhead0 ' + qrl0) + vs[(vhead0 ' + qrl0).last].next ' from (vhead0 ' + qrl0).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)
| vs[vs[(vhead0 ' + qrl0).last].next].deqID = None, ps[vhead0].deqID = None, vs[vs[(vhead0 ' + qrl0).last].next].next = null, ps[vs[(vhead0 ' + qrl0).last].next] = vs[vs[(vhead0 ' + qrl0).last].next], dom vrvHp = dom prvHp, (vhead0 ' + qrl0).last ≠ null, vs[(vhead0 ' + qrl0).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vhead0 ' + qrl0).last].next)), (vhead0 ' + qrl0).last ∈ ps, (vhead0 ' + qrl0).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + qrl0).last].next ∈ ps, vs[(vhead0 ' + qrl0).last].next ∈ vs, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl, ¬ (vhead0 ' + qrl0).last ∈ orl, ¬ (vhead0 ' + qrl0).last ∈ (vhead0 ' + qrl0) + vs[(vhead0 ' + qrl0).last].next ' from (vhead0 ' + qrl0).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vs[qrl0.last].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp = dom prvHp, qrl0.last ≠ null, vs[qrl0.last].next ≠ null, orl ≠ [], qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, qrl0.last ∈ vs, qrl0.last ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl, ¬ qrl0.last ∈ orl, ¬ qrl0.last ∈ (vhead0 ' + qrl0) + vs[qrl0.last].next ' from qrl0.last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0 ', qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vs[qrl0.last].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp = dom prvHp, qrl0.last ≠ null, vs[qrl0.last].next ≠ null, orl ≠ [], qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, qrl0.last ∈ vs, qrl0.last ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl, ¬ qrl0.last ∈ orl, ¬ qrl0.last ∈ (vhead0 ' + qrl0) + vs[qrl0.last].next ' from qrl0.last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, phead0, y
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl + vs[(orl + qrl).last].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, vs[(orl + qrl).last].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[(orl + qrl).last].next = vhead ⊃ vs[(orl + qrl).last].next ';[]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[(orl + qrl).last].next = vhead ⊃ vs[(orl + qrl).last].next ';[]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, qrl = [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[(orl + qrl).last].next = vhead ⊃ vs[(orl + qrl).last].next ';[]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, qrl.last ≠ null, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, qrl.last ∈ vs, qrl.last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[qrl.last].next = vhead ⊃ vs[qrl.last].next ';[]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, qrl = [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[(orl + qrl).last].next = vhead ⊃ vs[(orl + qrl).last].next ';[]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl.last ≠ orl.butlast.last, orl.last ≠ null, vs[orl.last].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), orl.last ∈ ps, orl.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vs[orl.last].next = orl.butlast.last ⊃ vs[orl.last].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl.last ≠ orl.butlast.last, orl.last ≠ null, vs[orl.last].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), orl.last ∈ ps, orl.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vs[orl.last].next = orl.butlast.last ⊃ vs[orl.last].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, orl.last ≠ orl.butlast.last, orl.last ≠ null, vs[orl.last].next ≠ null, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), vs[orl.last].next ∈ vs, vs[orl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, orl.last ∈ vs, orl.last ∈ ps, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vs[orl.last].next = orl.butlast.last ⊃ vs[orl.last].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, orl0
| vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, orl.last ≠ orl.butlast.last, orl.last ≠ null, vs[orl.last].next ≠ null, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), vs[orl.last].next ∈ vs, vs[orl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, orl.last ∈ vs, orl.last ∈ ps, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vs[orl.last].next = orl.butlast.last ⊃ vs[orl.last].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, orl0.last ≠ (phead0 ' + orl0.butlast).last, orl0.last ≠ null, (phead0 ' + orl0.butlast).last ≠ phead0, vs[orl0.last].next ≠ null, orl0 ≠ [], phead ≠ orl0.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[orl0.last].next)), orl0.last ∈ ps, orl0.last ∈ vs, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (vs[orl0.last].next = (phead0 ' + orl0.butlast).last ⊃ vs[orl0.last].next ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, orl0.last ≠ (phead0 ' + orl0.butlast).last, orl0.last ≠ null, (phead0 ' + orl0.butlast).last ≠ phead0, vs[orl0.last].next ≠ null, orl0 ≠ [], phead ≠ orl0.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[orl0.last].next)), orl0.last ∈ ps, orl0.last ∈ vs, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (vs[orl0.last].next = (phead0 ' + orl0.butlast).last ⊃ vs[orl0.last].next ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ null, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, phead1 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[phead1].next)), vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, phead ∈ ps, phead ∈ vs, phead1 ∈ vs, phead1 ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ (phead0 ' + orl).last ∈ (vs[phead1].next = (phead0 ' + orl).last ⊃ vs[phead1].next ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y
| vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ null, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, phead1 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[phead1].next)), vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, phead ∈ ps, phead ∈ vs, phead1 ∈ vs, phead1 ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ (phead0 ' + orl).last ∈ (vs[phead1].next = (phead0 ' + orl).last ⊃ vs[phead1].next ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, phead1 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + orl + phead1 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(phead0 ' + orl + phead1 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), weak?(owns(vs[phead1].next)), phead1 ∈ ps, phead1 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, ¬ dups(orl), ¬ (phead0 ' + orl).last ∈ (vs[phead1].next = (phead0 ' + orl).last ⊃ vs[phead1].next ';[]), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, phead1 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + orl + phead1 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(phead0 ' + orl + phead1 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), weak?(owns(vs[phead1].next)), phead1 ∈ ps, phead1 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, ¬ dups(orl), ¬ (phead0 ' + orl).last ∈ (vs[phead1].next = (phead0 ' + orl).last ⊃ vs[phead1].next ';[]), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: phead0 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, qrl.last ≠ null, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, qrl.last ∈ vs, qrl.last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[qrl.last].next = vhead ⊃ vs[qrl.last].next ';[]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, qrl.last ≠ null, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, qrl.last ∈ vs, qrl.last ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ (vs[qrl.last].next = vhead ⊃ vs[qrl.last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, qrl.last ≠ null, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, qrl.last ∈ vs, qrl.last ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ (vs[qrl.last].next = vhead ⊃ vs[qrl.last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, qrl = vhead0 + orl0, qrl.last ≠ null, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), qrl.last ∈ ps, qrl.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ (vs[qrl.last].next = vhead ⊃ vs[qrl.last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, qrl = vhead0 + orl0, qrl.last ≠ null, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), qrl.last ∈ ps, qrl.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ (vs[qrl.last].next = vhead ⊃ vs[qrl.last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(vhead0 ' + orl0).last].next].deqID = None, ps[vhead0].deqID = None, vs[vs[(vhead0 ' + orl0).last].next].next = null, ps[vs[(vhead0 ' + orl0).last].next] = vs[vs[(vhead0 ' + orl0).last].next], dom vrvHp = dom prvHp, (vhead0 ' + orl0).last ≠ null, vs[(vhead0 ' + orl0).last].next ≠ null, orl ≠ [], vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vhead0 ' + orl0).last].next)), vs[(vhead0 ' + orl0).last].next ∈ vs, vs[(vhead0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (vhead0 ' + orl0).last ∈ vs, (vhead0 ' + orl0).last ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[(vhead0 ' + orl0).last].next = vhead ⊃ vs[(vhead0 ' + orl0).last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[vs[(vhead0 ' + orl0).last].next].deqID = None, ps[vhead0].deqID = None, vs[vs[(vhead0 ' + orl0).last].next].next = null, ps[vs[(vhead0 ' + orl0).last].next] = vs[vs[(vhead0 ' + orl0).last].next], dom vrvHp = dom prvHp, (vhead0 ' + orl0).last ≠ null, vs[(vhead0 ' + orl0).last].next ≠ null, orl ≠ [], vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vhead0 ' + orl0).last].next)), vs[(vhead0 ' + orl0).last].next ∈ vs, vs[(vhead0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (vhead0 ' + orl0).last ∈ vs, (vhead0 ' + orl0).last ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[(vhead0 ' + orl0).last].next = vhead ⊃ vs[(vhead0 ' + orl0).last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vs[(vhead0 ' + orl0).last].next].deqID = None, vs[vs[(vhead0 ' + orl0).last].next].next = null, ps[vs[(vhead0 ' + orl0).last].next] = vs[vs[(vhead0 ' + orl0).last].next], dom vrvHp = dom prvHp, orl0 = [], (vhead0 ' + orl0).last ≠ null, vs[(vhead0 ' + orl0).last].next ≠ null, orl ≠ [], vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vhead0 ' + orl0).last].next)), (vhead0 ' + orl0).last ∈ ps, (vhead0 ' + orl0).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + orl0).last].next ∈ ps, vs[(vhead0 ' + orl0).last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[(vhead0 ' + orl0).last].next = vhead ⊃ vs[(vhead0 ' + orl0).last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[vhead0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, orl0.last ≠ null, vs[orl0.last].next ≠ null, orl ≠ [], orl0 ≠ [], vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), orl0.last ∈ ps, orl0.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[orl0.last].next = vhead ⊃ vs[orl0.last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: vhead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vs[(vhead0 ' + orl0).last].next].deqID = None, vs[vs[(vhead0 ' + orl0).last].next].next = null, ps[vs[(vhead0 ' + orl0).last].next] = vs[vs[(vhead0 ' + orl0).last].next], dom vrvHp = dom prvHp, orl0 = [], (vhead0 ' + orl0).last ≠ null, vs[(vhead0 ' + orl0).last].next ≠ null, orl ≠ [], vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vhead0 ' + orl0).last].next)), (vhead0 ' + orl0).last ∈ ps, (vhead0 ' + orl0).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + orl0).last].next ∈ ps, vs[(vhead0 ' + orl0).last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[(vhead0 ' + orl0).last].next = vhead ⊃ vs[(vhead0 ' + orl0).last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl.last ≠ orl.butlast.last, orl.butlast.last ≠ vhead0, vs[vhead0].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vhead0 ∈ orl, ¬ orl.butlast.last ∈ (vs[vhead0].next = orl.butlast.last ⊃ vs[vhead0].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)
| vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl.last ≠ orl.butlast.last, orl.butlast.last ≠ vhead0, vs[vhead0].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vhead0 ∈ orl, ¬ orl.butlast.last ∈ (vs[vhead0].next = orl.butlast.last ⊃ vs[vhead0].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, orl.last ≠ orl.butlast.last, orl.butlast.last ≠ vhead0, vs[vhead0].next ≠ null, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vhead0 ∈ orl, ¬ orl.butlast.last ∈ (vs[vhead0].next = orl.butlast.last ⊃ vs[vhead0].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, orl0
| vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, orl.last ≠ orl.butlast.last, orl.butlast.last ≠ vhead0, vs[vhead0].next ≠ null, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vhead0 ∈ orl, ¬ orl.butlast.last ∈ (vs[vhead0].next = orl.butlast.last ⊃ vs[vhead0].next ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ vhead0, (phead0 ' + orl0.butlast).last ≠ phead0, vs[vhead0].next ≠ null, orl0 ≠ [], phead ≠ orl0.last, vhead0 ≠ null, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + vhead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs((phead0 ' + orl0) + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ vhead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (vs[vhead0].next = (phead0 ' + orl0.butlast).last ⊃ vs[vhead0].next ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ vhead0, (phead0 ' + orl0.butlast).last ≠ phead0, vs[vhead0].next ≠ null, orl0 ≠ [], phead ≠ orl0.last, vhead0 ≠ null, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + vhead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs((phead0 ' + orl0) + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ vhead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (vs[vhead0].next = (phead0 ' + orl0.butlast).last ⊃ vs[vhead0].next ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', (phead0 ' + orl).last ≠ vhead0, (phead0 ' + orl).last ≠ phead0, vs[vhead0].next ≠ null, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, vhead0 ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vhead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs((phead0 ' + orl0) + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ vhead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ (vs[vhead0].next = (phead0 ' + orl).last ⊃ vs[vhead0].next ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y
| vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', (phead0 ' + orl).last ≠ vhead0, (phead0 ' + orl).last ≠ phead0, vs[vhead0].next ≠ null, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, vhead0 ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vhead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs((phead0 ' + orl0) + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ vhead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ (vs[vhead0].next = (phead0 ' + orl).last ⊃ vs[vhead0].next ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, (phead0 ' + orl).last ≠ vhead0, (phead0 ' + orl).last ≠ phead0, vs[vhead0].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, vhead0 ≠ null, vhead0 ≠ phead0, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl + phead1 ') + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs((phead0 ' + orl + phead1 ') + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl), ¬ (phead0 ' + orl).last ∈ (vs[vhead0].next = (phead0 ' + orl).last ⊃ vs[vhead0].next ';[]), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, ¬ vhead0 ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, (phead0 ' + orl).last ≠ vhead0, (phead0 ' + orl).last ≠ phead0, vs[vhead0].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, vhead0 ≠ null, vhead0 ≠ phead0, vhead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl + phead1 ') + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs((phead0 ' + orl + phead1 ') + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl), ¬ (phead0 ' + orl).last ∈ (vs[vhead0].next = (phead0 ' + orl).last ⊃ vs[vhead0].next ';[]), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, ¬ vhead0 ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: phead0 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, orl0.last ≠ null, vs[orl0.last].next ≠ null, orl ≠ [], orl0 ≠ [], vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), orl0.last ∈ ps, orl0.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[orl0.last].next = vhead ⊃ vs[orl0.last].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', vs[phead0].next ≠ null, orl ≠ [], orl0 ≠ [], phead0 ≠ null, vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[phead0].next = vhead ⊃ vs[phead0].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', vs[phead0].next ≠ null, orl ≠ [], orl0 ≠ [], phead0 ≠ null, vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead ∈ (vs[phead0].next = vhead ⊃ vs[phead0].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ (vs[phead0].next = vhead ⊃ vs[phead0].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ (vs[phead0].next = vhead ⊃ vs[phead0].next ';[]), ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ [], ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ [], ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].deqID = None, orl.butlast.last = vhead, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl.butlast ≠ [], vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], phead ≠ orl.last, phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val) ⊦
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].deqID = None, orl.butlast.last = vhead, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl.butlast ≠ [], vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], phead ≠ orl.last, phead0 ≠ null, vhead ≠ vhead0, vhead ≠ phead0, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val) ⊦ |
vs[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl.butlast.last ≠ vhead0, orl.butlast.last ≠ phead0, vs[phead0].next ≠ orl.butlast.last, vs[phead0].next ≠ null, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, phead0 ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, vs), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ orl1, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| vs[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl.butlast.last ≠ vhead0, orl.butlast.last ≠ phead0, vs[phead0].next ≠ orl.butlast.last, vs[phead0].next ≠ null, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, phead0 ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, vs), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ orl1, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = vhead + orl0, orl.butlast.last ≠ vhead0, orl.butlast.last ≠ phead0, vs[phead0].next ≠ orl.butlast.last, vs[phead0].next ≠ null, orl ≠ [], orl ≠ vhead ', phead ≠ orl.last, phead0 ≠ null, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ orl1, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, orl0
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = vhead + orl0, orl.butlast.last ≠ vhead0, orl.butlast.last ≠ phead0, vs[phead0].next ≠ orl.butlast.last, vs[phead0].next ≠ null, orl ≠ [], orl ≠ vhead ', phead ≠ orl.last, phead0 ≠ null, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ orl1, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, (vhead ' + orl0.butlast).last ≠ vhead0, (vhead ' + orl0.butlast).last ≠ phead0, (vhead ' + orl0.butlast).last ≠ vhead, vs[phead0].next ≠ null, vs[phead0].next ≠ (vhead ' + orl0.butlast).last, orl0 ≠ [], phead ≠ orl0.last, phead0 ≠ null, phead0 ≠ vhead, vhead0 ≠ phead0, vhead0 ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (vhead ' + orl0.butlast).last ∈ orl0, ¬ (vhead ' + orl0.butlast).last ∈ orl1, vs[(vhead ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(vhead ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vhead ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vhead ' + orl0.butlast).last].next].deqID.tid, vs[vs[(vhead ' + orl0.butlast).last].next].val), phead = vhead ∨ phead ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)
| vs[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, (vhead ' + orl0.butlast).last ≠ vhead0, (vhead ' + orl0.butlast).last ≠ phead0, (vhead ' + orl0.butlast).last ≠ vhead, vs[phead0].next ≠ null, vs[phead0].next ≠ (vhead ' + orl0.butlast).last, orl0 ≠ [], phead ≠ orl0.last, phead0 ≠ null, phead0 ≠ vhead, vhead0 ≠ phead0, vhead0 ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (vhead ' + orl0.butlast).last ∈ orl0, ¬ (vhead ' + orl0.butlast).last ∈ orl1, vs[(vhead ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(vhead ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vhead ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vhead ' + orl0.butlast).last].next].deqID.tid, vs[vs[(vhead ' + orl0.butlast).last].next].val), phead = vhead ∨ phead ∈ orl0 ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl + vhead1 ', (vhead ' + orl).last ≠ vhead0, (vhead ' + orl).last ≠ phead0, (vhead ' + orl).last ≠ vhead, vs[phead0].next ≠ null, vs[phead0].next ≠ (vhead ' + orl).last, orl0 ≠ [], phead ≠ vhead1, phead0 ≠ null, phead0 ≠ vhead, vhead0 ≠ phead0, vhead0 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (vhead ' + orl).last ∈ orl0, ¬ (vhead ' + orl).last ∈ orl1, vs[(vhead ' + orl).last].next ≠ null ∧ vs[vs[(vhead ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vhead ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(vhead ' + orl).last].next].deqID.tid, vs[vs[(vhead ' + orl).last].next].val), phead = vhead ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead1, y
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl + vhead1 ', (vhead ' + orl).last ≠ vhead0, (vhead ' + orl).last ≠ phead0, (vhead ' + orl).last ≠ vhead, vs[phead0].next ≠ null, vs[phead0].next ≠ (vhead ' + orl).last, orl0 ≠ [], phead ≠ vhead1, phead0 ≠ null, phead0 ≠ vhead, vhead0 ≠ phead0, vhead0 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs((vhead ' + orl0) + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (vhead ' + orl).last ∈ orl0, ¬ (vhead ' + orl).last ∈ orl1, vs[(vhead ' + orl).last].next ≠ null ∧ vs[vs[(vhead ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vhead ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(vhead ' + orl).last].next].deqID.tid, vs[vs[(vhead ' + orl).last].next].val), phead = vhead ∨ phead ∈ orl0 ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[ps[vhead1].next].deqID = None, vs[ps[vhead1].next].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, (vhead ' + orl).last ≠ vhead1, (vhead ' + orl).last ≠ vhead, (vhead ' + orl).last ≠ phead0, (vhead ' + orl).last ≠ ps[vhead1].next, ps[vhead1].next ≠ vhead1, ps[vhead1].next ≠ vhead, ps[vhead1].next ≠ phead0, vs[phead0].next ≠ (vhead ' + orl).last, vs[phead0].next ≠ null, phead ≠ vhead1, phead0 ≠ vhead1, phead0 ≠ vhead, phead0 ≠ null, vhead ≠ vhead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vhead ' + orl + vhead1 ') + ps[vhead1].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs((vhead ' + orl + vhead1 ') + ps[vhead1].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead1].deqID), some?(vs[vhead1].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ (vhead ' + orl).last ∈ orl, ¬ ps[vhead1].next ∈ orl1, ¬ ps[vhead1].next ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vhead ∈ orl1, ¬ vhead ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ (vhead ' + orl).last ∈ orl1, vs[(vhead ' + orl).last].next ≠ null ∧ vs[vs[(vhead ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vhead ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(vhead ' + orl).last].next].deqID.tid, vs[vs[(vhead ' + orl).last].next].val), phead = vhead ∨ phead ∈ orl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[ps[vhead1].next].deqID = None, vs[ps[vhead1].next].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, (vhead ' + orl).last ≠ vhead1, (vhead ' + orl).last ≠ vhead, (vhead ' + orl).last ≠ phead0, (vhead ' + orl).last ≠ ps[vhead1].next, ps[vhead1].next ≠ vhead1, ps[vhead1].next ≠ vhead, ps[vhead1].next ≠ phead0, vs[phead0].next ≠ (vhead ' + orl).last, vs[phead0].next ≠ null, phead ≠ vhead1, phead0 ≠ vhead1, phead0 ≠ vhead, phead0 ≠ null, vhead ≠ vhead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vhead ' + orl + vhead1 ') + ps[vhead1].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs((vhead ' + orl + vhead1 ') + ps[vhead1].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead1].deqID), some?(vs[vhead1].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ (vhead ' + orl).last ∈ orl, ¬ ps[vhead1].next ∈ orl1, ¬ ps[vhead1].next ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vhead ∈ orl1, ¬ vhead ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ (vhead ' + orl).last ∈ orl1, vs[(vhead ' + orl).last].next ≠ null ∧ vs[vs[(vhead ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vhead ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(vhead ' + orl).last].next].deqID.tid, vs[vs[(vhead ' + orl).last].next].val), phead = vhead ∨ phead ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vhead ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: ps, orl + qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, r = (orl + qrl).last, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next)
Used terms: ps, (orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, r = (orl + qrl).last, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, qrl = vtail0 + qrl0, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail0, y
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, qrl = vtail0 + qrl0, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, (vtail0 ' + qrl0).last ≠ null, ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), vs[(vtail0 ' + qrl0).last].next ∈ vs, vs[(vtail0 ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (vtail0 ' + qrl0).last ∈ vs, (vtail0 ' + qrl0).last ∈ ps, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)
| ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, (vtail0 ' + qrl0).last ≠ null, ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), vs[(vtail0 ' + qrl0).last].next ∈ vs, vs[(vtail0 ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (vtail0 ' + qrl0).last ∈ vs, (vtail0 ' + qrl0).last ∈ ps, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, qrl0 = [], (vtail0 ' + qrl0).last ≠ null, ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), (vtail0 ' + qrl0).last ∈ ps, (vtail0 ' + qrl0).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
vs[vs[qrl0.last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[qrl0.last].next].next = null, ps[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp = dom prvHp, qrl0.last ≠ null, ps[qrl0.last].next ≠ null, vs[qrl0.last].next ≠ ps[qrl0.last].next, vs[qrl0.last].next ≠ null, orl ≠ [], qrl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[qrl0.last].next)), qrl0.last ∈ ps, qrl0.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[qrl0.last].next ∈ ps, vs[qrl0.last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used terms: vtail0 ', qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, qrl0 = [], (vtail0 ' + qrl0).last ≠ null, ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), (vtail0 ' + qrl0).last ∈ ps, (vtail0 ' + qrl0).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, ps[vtail0].next ≠ null, vs[vtail0].next ≠ ps[vtail0].next, vs[vtail0].next ≠ null, orl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, ps[vtail0].next ≠ null, vs[vtail0].next ≠ ps[vtail0].next, vs[vtail0].next ≠ null, orl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' ≠ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) Used terms: ps, orl, owns, vtail0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[qrl0.last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[qrl0.last].next].next = null, ps[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp = dom prvHp, qrl0.last ≠ null, ps[qrl0.last].next ≠ null, vs[qrl0.last].next ≠ ps[qrl0.last].next, vs[qrl0.last].next ≠ null, orl ≠ [], qrl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[qrl0.last].next)), qrl0.last ∈ ps, qrl0.last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[qrl0.last].next ∈ ps, vs[qrl0.last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, qrl0 = orl0 + vhead0 ', ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, orl ≠ [], qrl0 ≠ [], vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vhead0, y
| ps[vtail0].deqID = None, vs[vs[vhead0].next].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, qrl0 = orl0 + vhead0 ', ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, orl ≠ [], qrl0 ≠ [], vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
vs[vs[vhead0].next].deqID = None, ps[vtail0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, orl ≠ [], vhead0 ≠ null, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| vs[vs[vhead0].next].deqID = None, ps[vtail0].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, orl ≠ [], vhead0 ≠ null, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' ≠ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) Used terms: ps, orl + vtail0 ' + orl0, owns, vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[(orl + qrl).last].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next] ∧ vs[r] = vs[r] ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ owns(vs[(orl + qrl).last].next; None)(r) = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: ps, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], tid0, owns, vs, owns(vs[(orl + qrl).last].next; None), vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[(orl + qrl).last].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next] ∧ vs[r] = vs[r] ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ owns(vs[(orl + qrl).last].next; None)(r) = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, r = (orl + qrl).last, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r ≠ (orl + qrl).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next)
Used terms: ps, (orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, r = (orl + qrl).last, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, (vs[(orl + qrl).last].next = (orl + qrl).last ⊃ None;owns((orl + qrl).last)) ≠ owns((orl + qrl).last), orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns((orl + qrl).last) = Some(tid0) ∨ owns((orl + qrl).last) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ (orl + qrl).last → None = owns((orl + qrl).last)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a ∈ st[a, d]; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, (vs[(orl + qrl).last].next = (orl + qrl).last ⊃ None;owns((orl + qrl).last)) ≠ owns((orl + qrl).last), orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns((orl + qrl).last) = Some(tid0) ∨ owns((orl + qrl).last) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ (orl + qrl).last → None = owns((orl + qrl).last)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r ≠ (orl + qrl).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ (orl + qrl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ (orl + qrl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl + vs[(orl + qrl).last].next ', r, vs)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl + qrl, tid0, vs, orl + qrl + vs[(orl + qrl).last].next ', vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl + vs[(orl + qrl).last].next ', r, vs)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ orl, ¬ r0 ∈ orl + qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: orl, qrl + vs[(orl + qrl).last].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ orl, ¬ r0 ∈ orl + qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ qrl, ¬ r ∈ orl, ¬ r0 ∈ qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: qrl, vs[(orl + qrl).last].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ qrl, ¬ r ∈ orl, ¬ r0 ∈ qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ (vs[(orl + qrl).last].next = r ⊃ vs[(orl + qrl).last].next ';[]), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ qrl, ¬ r ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ (vs[(orl + qrl).last].next = r ⊃ vs[(orl + qrl).last].next ';[]), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r ∈ qrl, ¬ r ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid)
Used terms: tid0, owns, owns(vs[(orl + qrl).last].next; None)
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns)), r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null, vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], owns)
Used simplifier rules: ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x = x + y ↔ y = []; (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null, vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], owns) |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + vhead0 ' + orl0.butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + vhead0 ' + orl0.butlast).last ∈ orl + vhead0 ' + orl0 from (orl + vhead0 ' + orl0.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: vhead0 ', orl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl.last ≠ vhead0, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ vhead0 ∈ orl, ¬ orl.last ∈ orl + vhead0 ' from orl.last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl.last ≠ vhead0, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ vhead0 ∈ orl, ¬ orl.last ∈ orl + vhead0 ' from orl.last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + vhead0 ' + orl0.butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + vhead0 ' + orl0.butlast).last ∈ orl + vhead0 ' + orl0 from (orl + vhead0 ' + orl0.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vhead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl0.butlast).last ≠ orl0.last, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl0.butlast).last ∈ orl + vhead0 ' + orl0 from (vhead0 ' + orl0.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps[vhead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl0.butlast).last ≠ orl0.last, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl0.butlast).last ∈ orl + vhead0 ' + orl0 from (vhead0 ' + orl0.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', (vhead0 ' + orl1).last ≠ phead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl1).last ∈ orl + vhead0 ' + orl0 from (vhead0 ' + orl1).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', (vhead0 ' + orl1).last ≠ phead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl1).last ∈ orl + vhead0 ' + orl0 from (vhead0 ' + orl1).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vhead0].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl1).last ≠ phead0, orl ≠ [], r ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (vhead0 ' + orl1).last ∈ orl + vhead0 ' + orl1 + phead0 ' from (vhead0 ' + orl1).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[vhead0].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl1).last ≠ phead0, orl ≠ [], r ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (vhead0 ' + orl1).last ∈ orl + vhead0 ' + orl1 + phead0 ' from (vhead0 ' + orl1).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + r0 ', (vhead0 ' + orl1).last ≠ phead0, orl ≠ [], r ≠ null, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (vhead0 ' + orl1).last ∈ orl + vhead0 ' + orl1 + phead0 ' from (vhead0 ' + orl1).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ r0 ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, r0, y
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + r0 ', (vhead0 ' + orl1).last ≠ phead0, orl ≠ [], r ≠ null, vhead0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (vhead0 ' + orl1).last ∈ orl + vhead0 ' + orl1 + phead0 ' from (vhead0 ' + orl1).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ r0 ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[r0].next].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, (ps[r0].next ' + orl1).last ≠ phead0, ps[r0].next ≠ r0, ps[r0].next ≠ phead0, phead0 ≠ r0, r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[r0].deqID), some?(vs[r0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[r0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (ps[r0].next ' + orl1).last ∈ (orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ' from (ps[r0].next ' + orl1).last, ¬ r0 ∈ orl1, ¬ r0 ∈ orl0, ¬ ps[r0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = r0, r0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ r0 ∧ vs[ps[r0].next].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[r0].next].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, (ps[r0].next ' + orl1).last ≠ phead0, ps[r0].next ≠ r0, ps[r0].next ≠ phead0, phead0 ≠ r0, r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nonullRetRefs((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[r0].deqID), some?(vs[r0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[r0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (ps[r0].next ' + orl1).last ∈ (orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ' from (ps[r0].next ' + orl1).last, ¬ r0 ∈ orl1, ¬ r0 ∈ orl0, ¬ ps[r0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = r0, r0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ r0 ∧ vs[ps[r0].next].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[ps[r0].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1.last ≠ phead0, ps[r0].next ≠ r0, ps[r0].next ≠ phead0, orl1 ≠ [], phead0 ≠ r0, r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r0].deqID), some?(ps[r0].deqID), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[r0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ orl1.last ∈ (orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ' from orl1.last, ¬ r0 ∈ orl1, ¬ r0 ∈ orl0, ¬ ps[r0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ r0 ∧ vs[ps[r0].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ orl0 ∨ phead = r0 ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[r0].next ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[ps[r0].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl1.last ≠ phead0, ps[r0].next ≠ r0, ps[r0].next ≠ phead0, orl1 ≠ [], phead0 ≠ r0, r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nonullRetRefs((orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r0].deqID), some?(ps[r0].deqID), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[r0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ orl1.last ∈ (orl0 + r0 ') + ps[r0].next ' + orl1 + phead0 ' from orl1.last, ¬ r0 ∈ orl1, ¬ r0 ∈ orl0, ¬ ps[r0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ r0 ∧ vs[ps[r0].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ orl0 ∨ phead = r0 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, vhead0, y
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
⊦ r ∈ rl → r ∈ rl from r
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl, ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used terms: vhead, orl + qrl
| ⊦ r ∈ rl → r ∈ rl from r |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl, ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ orl + qrl → vs[r0].val = vs[r0].val ∧ ps[r0].val = ps[r, ps[r].next:= vs[r].next][r0].val ∧ (vs[r0].deqID ≠ None → vs[r0].deqID = vs[r0].deqID) ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID) ∧ (vs[r0].next ≠ null → vs[r0].next = vs[r0].next) ∧ (ps[r0].next ≠ null → ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used terms: ps, orl + qrl, ps[r, ps[r].next:= vs[r].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ orl + qrl → vs[r0].val = vs[r0].val ∧ ps[r0].val = ps[r, ps[r].next:= vs[r].next][r0].val ∧ (vs[r0].deqID ≠ None → vs[r0].deqID = vs[r0].deqID) ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID) ∧ (vs[r0].next ≠ null → vs[r0].next = vs[r0].next) ∧ (ps[r0].next ≠ null → ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r0 ∈ orl ∨ r0 ∈ qrl ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null, ps[r0].val = ps[r, ps[r].next:= vs[r].next][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r0 ∈ orl ∨ r0 ∈ qrl ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null, ps[r0].val = ps[r, ps[r].next:= vs[r].next][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
dom vrvHp = dom prvHp, r0 = r, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ orl ∨ r0 ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[r0].val = ps[r, ps[r].next:= vs[r].next][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next), r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used terms: ps, r, ps[r].next:= vs[r].next, r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, r0 = r, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ orl ∨ r0 ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[r0].val = ps[r, ps[r].next:= vs[r].next][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next), r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
dom vrvHp = dom prvHp, vs[r].next ≠ ps[r].next, ps[r].next ≠ null, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s)
| dom vrvHp = dom prvHp, vs[r].next ≠ ps[r].next, ps[r].next ≠ null, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
dom vrvHp = dom prvHp, vs[r].next ≠ ps[r].next, ps[r].next ≠ null, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ r ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used terms: ps, orl + qrl, owns, r, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| dom vrvHp = dom prvHp, vs[r].next ≠ ps[r].next, ps[r].next ≠ null, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ r ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
orl + qrl = rl1 + r ' + rl2, dom vrvHp = dom prvHp, vs[r].next ≠ ps[r].next, ps[r].next ≠ null, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(r ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl + qrl = rl1 + r ' + rl2, dom vrvHp = dom prvHp, vs[r].next ≠ ps[r].next, ps[r].next ≠ null, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(r ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].next:= vs[r].next], owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None) → r0 ∈ vs ∧ r0 ∈ ps[r, ps[r].next:= vs[r].next] ∧ vs[r0] = vs[r0] ∧ (ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next ∨ ps[r, ps[r].next:= vs[r].next][r0].next = vs[r0].next) ∧ (ps[r, ps[r].next:= vs[r].next][r0].val = ps[r0].val ∨ ps[r, ps[r].next:= vs[r].next][r0].val = vs[r0].val) ∧ (ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].next:= vs[r].next][r0].deqID = vs[r0].deqID) ∧ owns(r0) = owns(r0)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null
Used terms: ps, ps[r, ps[r].next:= vs[r].next], tid0, owns, vs, owns, vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None) → r0 ∈ vs ∧ r0 ∈ ps[r, ps[r].next:= vs[r].next] ∧ vs[r0] = vs[r0] ∧ (ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next ∨ ps[r, ps[r].next:= vs[r].next][r0].next = vs[r0].next) ∧ (ps[r, ps[r].next:= vs[r].next][r0].val = ps[r0].val ∨ ps[r, ps[r].next:= vs[r].next][r0].val = vs[r0].val) ∧ (ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].next:= vs[r].next][r0].deqID = vs[r0].deqID) ∧ owns(r0) = owns(r0)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r0 ∈ ps, r0 ∈ vs, r0 ∈ ps[r, ps[r].next:= vs[r].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null, (ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].next:= vs[r].next][r0].deqID = vs[r0].deqID) ∧ (ps[r, ps[r].next:= vs[r].next][r0].val = ps[r0].val ∨ ps[r, ps[r].next:= vs[r].next][r0].val = vs[r0].val) ∧ (ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next ∨ ps[r, ps[r].next:= vs[r].next][r0].next = vs[r0].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r0 ∈ ps, r0 ∈ vs, r0 ∈ ps[r, ps[r].next:= vs[r].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None ⊦ r = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null, (ps[r, ps[r].next:= vs[r].next][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].next:= vs[r].next][r0].deqID = vs[r0].deqID) ∧ (ps[r, ps[r].next:= vs[r].next][r0].val = ps[r0].val ∨ ps[r, ps[r].next:= vs[r].next][r0].val = vs[r0].val) ∧ (ps[r, ps[r].next:= vs[r].next][r0].next = ps[r0].next ∨ ps[r, ps[r].next:= vs[r].next][r0].next = vs[r0].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, r, ps[r].next:= vs[r].next, r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.