| ⊦ ls.tid ≠ tid0 ∧ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D19, a) = D20, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D19, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns)
| ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D19, a) = D20, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D19, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ 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.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, ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, 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) ⊦ (∃ rl. gs.orl + gs.qrl + rl = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl) ∧ (∃ rl0. gs.orl + rl0 = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from gs.vtail ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from gs.phead ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns) ∧ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (tid0) ∧ ( gs.pretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs (tid0) ∨ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs (tid0)) ∧ rvownsrely (tid0, gs.rvowns, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ dom gs.prvHp ⊆ dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp ∧ prvHpRely (gs.vrvHp, gs.prvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ ownsRely (tid0, gs.owns, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns)
Used simplifier rules: ⊦ Val(val).val = val; (s) 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 ⊦ gstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]) .rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pcstepf(gs, ls, D19, a) = D20; (s)
| ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ 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.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, ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, 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) ⊦ (∃ rl. gs.orl + gs.qrl + rl = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl) ∧ (∃ rl0. gs.orl + rl0 = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from gs.vtail ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from gs.phead ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns) ∧ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (tid0) ∧ ( gs.pretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs (tid0) ∨ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs (tid0)) ∧ rvownsrely (tid0, gs.rvowns, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ dom gs.prvHp ⊆ dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp ∧ prvHpRely (gs.vrvHp, gs.prvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ ownsRely (tid0, gs.owns, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns) |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ 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), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from vtail ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from phead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .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
| ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ 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), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from vtail ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from phead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .owns) |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ 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, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns:= rvowns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns0); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs:= ps2 = mkgs (ps, ps2, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)
| ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ 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, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, ¬ 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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, ¬ 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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, ¬ 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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
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: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, ¬ 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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
(ps ⊕ vs)[ps[first].next].deqID = None, dom vrvHp = dom prvHp, mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (ps ⊕ vs)[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
| (ps ⊕ vs)[ps[first].next].deqID = None, dom vrvHp = dom prvHp, mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
(ps0 ⊕ vs)[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0) ∧ equalowns(vs, ps0, owns0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownsrely(tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) 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 ⊦ ownsRely(tid, owns, owns); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (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) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| (ps0 ⊕ vs)[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0) ∧ equalowns(vs, ps0, owns0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownsrely(tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) |
⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0) ∧ equalowns(vs, ps0, owns0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownsrely(tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])
Used terms: ps0, vs, ps0[first].next
| ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0) ∧ equalowns(vs, ps0, owns0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownsrely(tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalowns(vs, ps0, owns0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ rvownsrely(tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottidRely(tid0, vhead0, vs, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
vs[qrl0.last].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0 ⊦
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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[qrl0.last].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0 ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[qrl0.last].deqID = None, vs[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[qrl0.last].deqID = None, vs[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl ⊦
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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (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) ⊦ a ' + x ≠ []; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl ⊦ |
⊦ r ∈ rl → r ∈ rl from r
ps0[phead].deqID = None, vs[(phead ' + orl).last].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (orl0 + (phead ' + orl).butlast).last, orl0 + phead ' + orl
| ⊦ r ∈ rl → r ∈ rl from r |
| ps0[phead].deqID = None, vs[(phead ' + orl).last].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs) ⊦ |
ps0[phead].deqID = None, vs[(phead ' + orl).last].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + (phead ' + orl).butlast).last ≠ phead, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs), lst ∈ orl ∨ lst ∈ orl0 from first ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps0[phead].deqID = None, vs[(phead ' + orl).last].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + (phead ' + orl).butlast).last ≠ phead, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs), lst ∈ orl ∨ lst ∈ orl0 from first ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + phead ' + orl.butlast).last ≠ phead, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs) ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: phead ', orl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (orl0 + phead ' + orl.butlast).last ≠ phead, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[orl.last].deqID = None, vs[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (phead ' + orl.butlast).last ≠ phead, (phead ' + orl.butlast).last ≠ orl.last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(orl, ps0), vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs), lst ∈ orl ∨ lst ∈ orl0 from first ⊦
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)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[orl.last].deqID = None, vs[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (phead ' + orl.butlast).last ≠ phead, (phead ' + orl.butlast).last ≠ orl.last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(orl, ps0), vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs), lst ∈ orl ∨ lst ∈ orl0 from first ⊦ |
vs[vhead].deqID = None, ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vhead].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (phead ' + orl1).last ≠ phead, (phead ' + orl1).last ≠ vhead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl1).last ∈ orl, ¬ (phead ' + orl1).last ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead, y
| vs[vhead].deqID = None, ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vhead].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (phead ' + orl1).last ≠ phead, (phead ' + orl1).last ≠ vhead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl, first, vs), nonullRetRefs(orl0 + phead ' + orl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl1).last ∈ orl, ¬ (phead ' + orl1).last ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl, vs) ⊦ |
ps0[vhead].deqID = None, vs[vhead].deqID = None, ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vhead].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, lst ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl1 + vhead ', first, vs), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl1, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ (phead ' + orl1).last ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ (phead ' + orl1).last ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl1, vs), lst ∈ orl0 from first ∨ lst ∈ orl1 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (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) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[vhead].deqID = None, vs[vhead].deqID = None, ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vhead].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, lst ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + phead ' + orl1 + vhead ', first, vs), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(orl1, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ (phead ' + orl1).last ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ (phead ' + orl1).last ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(orl1, vs), lst ∈ orl0 from first ∨ lst ∈ orl1 ⊦ |
⊦ 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: phead ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ r ∈ rl → r ∈ rl from r
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0, orl0 + qrl0
| ⊦ r ∈ rl → r ∈ rl from r |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), listp(orl0 + qrl0, vs, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs, ps0, owns0)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: ps0, orl0, owns0, first, qrl0, vs
| ⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalrl(orl0 + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), listp(orl0 + qrl0, vs, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs, ps0, owns0)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ equalrl((rl1 + first ' + rl2) + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦
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 ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ equalrl((rl1 + first ' + rl2) + qrl0, vs, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
⊦ 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))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ (rl1 + first ' + rl2) + qrl0 → vs[r].val = vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].val ∧ ps0[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].deqID = vs[r].deqID) ∧ (ps0[r].deqID ≠ None → ps0[r].deqID = ps0[r].deqID) ∧ (vs[r].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].next = vs[r].next) ∧ (ps0[r].next ≠ null → ps0[r].next = ps0[r].next) ∧ ( vs[((rl1 + first ' + rl2) + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][((rl1 + first ' + rl2) + qrl0).last].next = vs[((rl1 + first ' + rl2) + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][((rl1 + first ' + rl2) + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][((rl1 + first ' + rl2) + qrl0).last].next].val)), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: ps0, (rl1 + first ' + rl2) + qrl0, ps0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], 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)) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ (rl1 + first ' + rl2) + qrl0 → vs[r].val = vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].val ∧ ps0[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].deqID = vs[r].deqID) ∧ (ps0[r].deqID ≠ None → ps0[r].deqID = ps0[r].deqID) ∧ (vs[r].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].next = vs[r].next) ∧ (ps0[r].next ≠ null → ps0[r].next = ps0[r].next) ∧ ( vs[((rl1 + first ' + rl2) + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][((rl1 + first ' + rl2) + qrl0).last].next = vs[((rl1 + first ' + rl2) + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][((rl1 + first ' + rl2) + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][((rl1 + first ' + rl2) + qrl0).last].next].val)), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0 ⊦ vs[r].val = vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].val ∧ (vs[r].deqID ≠ None → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].next = vs[r].next) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0 ⊦ vs[r].val = vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].val ∧ (vs[r].deqID ≠ None → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].next = vs[r].next) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val) |
⊦ a ≠ b → st[b, d][a] = st[a]
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r = ps0[first].next, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[r].val = vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].val ∧ (vs[r].deqID ≠ None → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].next = vs[r].next) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val)
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val)
Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r = ps0[first].next, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[r].val = vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].val ∧ (vs[r].deqID ≠ None → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r].next = vs[r].next) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val) |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0 ⊦ (vs[ps0[first].next].deqID ≠ None → Some(tid) = vs[ps0[first].next].deqID) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val)
Used simplifier rules: ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0 ⊦ (vs[ps0[first].next].deqID ≠ None → Some(tid) = vs[ps0[first].next].deqID) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val) |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, Some(tid) ≠ vs[ps0[first].next].deqID, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[(first ' + rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, Some(tid) ≠ vs[ps0[first].next].deqID, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, Some(tid) ≠ vs[ps0[first].next].deqID, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), ps0[first].next ∈ rl2 ∨ ps0[first].next = first ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ 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
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, Some(tid) ≠ vs[ps0[first].next].deqID, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), ps0[first].next ∈ rl2 ∨ ps0[first].next = first ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, Some(tid) ≠ vs[ps0[first].next].deqID, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl2 ∨ ps0[first].next = first, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, Some(tid) ≠ vs[ps0[first].next].deqID, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl2 ∨ ps0[first].next = first, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(tid) ≠ vs[vs[first].next].deqID, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs), phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1 ⊦
Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) 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 ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(tid) ≠ vs[vs[first].next].deqID, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs), phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1 ⊦ |
ps0[first].deqID = vs[first].deqID, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(tid) ≠ vs[vs[first].next].deqID, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1, (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ 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] ⊦ some?(opttid) → opttid ≠ None; (as)
| ps0[first].deqID = vs[first].deqID, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(tid) ≠ vs[vs[first].next].deqID, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1, (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl ⊦ |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(tid) ≠ vs[vs[first].next].deqID, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + qrl0, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 = vs[first].next, vtail0 = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ qrl0, vs[first].next = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ first = vhead0 ∧ unmarkedp(qrl0, vs), phead0 = first ∨ phead0 ∈ rl1 ⊦
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 ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(tid) ≠ vs[vs[first].next].deqID, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + qrl0, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 = vs[first].next, vtail0 = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ qrl0, vs[first].next = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ first = vhead0 ∧ unmarkedp(qrl0, vs), phead0 = first ∨ phead0 ∈ rl1 ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ 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] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ unmarkedp([], vs); (s) ⊦ 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) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, vtail, y
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[(first ' + rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val |
vs[vs[(first ' + rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(first ' + rl2 + qrl0).last].next].next = null, ps0[vs[(first ' + rl2 + qrl0).last].next] = vs[vs[(first ' + rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(first ' + rl2 + qrl0).last].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(first ' + rl2 + qrl0).last].next)), vs[(first ' + rl2 + qrl0).last].next ∈ vs, vs[(first ' + rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val
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]
| vs[vs[(first ' + rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(first ' + rl2 + qrl0).last].next].next = null, ps0[vs[(first ' + rl2 + qrl0).last].next] = vs[vs[(first ' + rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(first ' + rl2 + qrl0).last].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(first ' + rl2 + qrl0).last].next)), vs[(first ' + rl2 + qrl0).last].next ∈ vs, vs[(first ' + rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val |
⊦ y ≠ [] → (x + y).last = y.last
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[(rl2 + qrl0).last].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[(rl2 + qrl0).last].next ∈ ps0, vs[(rl2 + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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: first ', rl2 + qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[(rl2 + qrl0).last].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[(rl2 + qrl0).last].next ∈ ps0, vs[(rl2 + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = [], rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[(rl2 + qrl0).last].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), vs[(rl2 + qrl0).last].next ∈ vs, vs[(rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val
vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[qrl0.last].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val
Used terms: rl2, qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = [], rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[(rl2 + qrl0).last].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), vs[(rl2 + qrl0).last].next ∈ vs, vs[(rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val |
vs[vs[rl2.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl2.last].next].next = null, ps0[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[rl2.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2, vs, ps0, owns0), listp(rl1 + first ' + rl2, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[rl2.last].next)), lst ∈ ps0, lst ∈ vs, lst ∈ rl2, vs[rl2.last].next ∈ vs, vs[rl2.last].next ∈ ps0, rl2.last ∈ rl1 + first ' + rl2 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2, rl2.last = vhead0 ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next = vs[rl2.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ ¬ dups([]); (s)
| vs[vs[rl2.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl2.last].next].next = null, ps0[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[rl2.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2, vs, ps0, owns0), listp(rl1 + first ' + rl2, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[rl2.last].next)), lst ∈ ps0, lst ∈ vs, lst ∈ rl2, vs[rl2.last].next ∈ vs, vs[rl2.last].next ∈ ps0, rl2.last ∈ rl1 + first ' + rl2 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2, rl2.last = vhead0 ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next = vs[rl2.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = rl + phead ', rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2, vs, ps0, owns0), listp(first ' + rl2, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ rl2, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, phead, y
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = rl + phead ', rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2, vs, ps0, owns0), listp(first ' + rl2, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ rl2, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), some?(ps0[phead].deqID), some?(vs[phead].deqID), weak?(owns0(vs[phead].next)), lst ∈ ps0, lst ∈ vs, vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, lst ∈ rl ∨ lst = phead, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl ∨ ps0[first].next = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
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 ∈ 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[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), some?(ps0[phead].deqID), some?(vs[phead].deqID), weak?(owns0(vs[phead].next)), lst ∈ ps0, lst ∈ vs, vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, lst ∈ rl ∨ lst = phead, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl ∨ ps0[first].next = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
⊦ a ≠ b → st[b, d][a] = st[a]
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl ∨ ps0[first].next = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), phead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl ∨ ps0[first].next = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val |
vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ first ∈ rl, ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl, vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ first ∈ rl, ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl, vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[phead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[qrl0.last].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val |
vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[qrl0.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val
| vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[qrl0.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[qrl0.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[qrl0.last].next ∈ ps0, vs[qrl0.last].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[qrl0.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[qrl0.last].next ∈ ps0, vs[qrl0.last].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), vs[(phead ' + rl).last].next ∈ vs, vs[(phead ' + rl).last].next ∈ ps0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val
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 = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), vs[(phead ' + rl).last].next ∈ vs, vs[(phead ' + rl).last].next ∈ ps0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val |
⊦ y ≠ [] → (x + y).last = y.last
ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[(phead ' + rl).last].next ∈ ps0, vs[(phead ' + rl).last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val
ps0[phead].deqID = None, vs[vs[rl.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl.last].next].next = null, ps0[vs[rl.last].next] = vs[vs[rl.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[rl.last].next ≠ null, first ≠ lst, first ≠ phead, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[rl.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl.last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[rl.last].next ∈ ps0, vs[rl.last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next = vs[rl.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val
Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[(phead ' + rl).last].next ∈ ps0, vs[(phead ' + rl).last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val |
ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[phead].next)), vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
Used simplifier rules: ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s)
| ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[phead].next)), vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, phead = ps0[first].next, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val
Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), phead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, phead = ps0[first].next, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
ps0[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + ps0[first].next ', vs, ps0, owns0), listp(first ' + rl2 + ps0[first].next ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[ps0[first].next].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, ps0[first].next ∈ rl1 + first ' + rl2 + ps0[first].next ' from lst, vs[ps0[first].next].next ∈ ps0, vs[ps0[first].next].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = ps0[first].next, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s)
| ps0[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + ps0[first].next ', vs, ps0, owns0), listp(first ' + rl2 + ps0[first].next ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[ps0[first].next].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, ps0[first].next ∈ rl1 + first ' + rl2 + ps0[first].next ' from lst, vs[ps0[first].next].next ∈ ps0, vs[ps0[first].next].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = ps0[first].next, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[ps0[first].next].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val |
ps0[phead].deqID = None, vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ phead ∈ rl1, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| ps0[phead].deqID = None, vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ phead ∈ rl1, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[phead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[phead].deqID = None, vs[vs[rl.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl.last].next].next = null, ps0[vs[rl.last].next] = vs[vs[rl.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[rl.last].next ≠ null, first ≠ lst, first ≠ phead, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[rl.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl.last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[rl.last].next ∈ ps0, vs[rl.last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next = vs[rl.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = rl0 + vhead ', rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead, y
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = rl0 + vhead ', rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val |
ps0[phead].deqID = None, vs[vs[vhead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[vhead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vs[vhead].next ∈ ps0, vs[vhead].next ∈ vs, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0 ∨ ps0[first].next = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val
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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[phead].deqID = None, vs[vs[vhead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[vhead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vs[vhead].next ∈ ps0, vs[vhead].next ∈ vs, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0 ∨ ps0[first].next = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val |
⊦ a ≠ b → st[b, d][a] = st[a]
ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead = ps0[first].next, ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0 ∨ ps0[first].next = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val
ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0 ∨ ps0[first].next = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val = vs[vs[vhead].next].val
Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vhead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead = ps0[first].next, ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0 ∨ ps0[first].next = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val |
vs[vs[ps0[first].next].next].deqID = None, ps0[phead].deqID = None, ps0[ps0[first].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[ps0[first].next].next)), vs[ps0[first].next].next ∈ vs, vs[ps0[first].next].next ∈ ps0, ps0[first].next ∈ rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ ps0[first].next ∈ rl0, ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = ps0[first].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s)
| vs[vs[ps0[first].next].next].deqID = None, ps0[phead].deqID = None, ps0[ps0[first].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[ps0[first].next].next)), vs[ps0[first].next].next ∈ vs, vs[ps0[first].next].next ∈ ps0, ps0[first].next ∈ rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ ps0[first].next ∈ rl0, ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = ps0[first].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[ps0[first].next].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0 ∨ ps0[first].next = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val = vs[vs[vhead].next].val |
vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vhead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val ≠ vs[vs[vhead].next].val, first ≠ vhead, first ≠ phead, first ≠ lst, phead ≠ vhead, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ vhead ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vhead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val ≠ vs[vs[vhead].next].val, first ≠ vhead, first ≠ phead, first ≠ lst, phead ≠ vhead, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ vhead ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].next ∈ rl1 ∨ ps0[first].next = first ∨ ps0[first].next ∈ rl2 ∨ ps0[first].next = phead ∨ ps0[first].next ∈ rl0, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[vhead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ ( vs[(first ' + rl2 + qrl0).last].next ≠ null → vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val) |
vs[vs[(first ' + rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(first ' + rl2 + qrl0).last].next].next = null, ps0[vs[(first ' + rl2 + qrl0).last].next] = vs[vs[(first ' + rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[(first ' + rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(first ' + rl2 + qrl0).last].next)), vs[(first ' + rl2 + qrl0).last].next ∈ vs, vs[(first ' + rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val
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]
| vs[vs[(first ' + rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(first ' + rl2 + qrl0).last].next].next = null, ps0[vs[(first ' + rl2 + qrl0).last].next] = vs[vs[(first ' + rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[(first ' + rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(first ' + rl2 + qrl0).last].next)), vs[(first ' + rl2 + qrl0).last].next ∈ vs, vs[(first ' + rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next = vs[(first ' + rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] [vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next ] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(first ' + rl2 + qrl0).last].next].val |
⊦ y ≠ [] → (x + y).last = y.last
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[(rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[(rl2 + qrl0).last].next ∈ ps0, vs[(rl2 + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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: first ', rl2 + qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[(rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[(rl2 + qrl0).last].next ∈ ps0, vs[(rl2 + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = [], rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[(rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), vs[(rl2 + qrl0).last].next ∈ vs, vs[(rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val
vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[qrl0.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val
Used terms: rl2, qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(rl2 + qrl0).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(rl2 + qrl0).last].next].next = null, ps0[vs[(rl2 + qrl0).last].next] = vs[vs[(rl2 + qrl0).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = [], rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[(rl2 + qrl0).last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[(rl2 + qrl0).last].next)), vs[(rl2 + qrl0).last].next ∈ vs, vs[(rl2 + qrl0).last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next = vs[(rl2 + qrl0).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(rl2 + qrl0).last].next].val |
vs[vs[rl2.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl2.last].next].next = null, ps0[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[rl2.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2, vs, ps0, owns0), listp(rl1 + first ' + rl2, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[rl2.last].next)), lst ∈ ps0, lst ∈ vs, lst ∈ rl2, vs[rl2.last].next ∈ vs, vs[rl2.last].next ∈ ps0, rl2.last ∈ rl1 + first ' + rl2 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2, rl2.last = vhead0 ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next = vs[rl2.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ ¬ dups([]); (s)
| vs[vs[rl2.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl2.last].next].next = null, ps0[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[rl2.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2, vs, ps0, owns0), listp(rl1 + first ' + rl2, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[rl2.last].next)), lst ∈ ps0, lst ∈ vs, lst ∈ rl2, vs[rl2.last].next ∈ vs, vs[rl2.last].next ∈ ps0, rl2.last ∈ rl1 + first ' + rl2 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2, rl2.last = vhead0 ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next = vs[rl2.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl2.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = rl + phead ', rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2, vs, ps0, owns0), listp(first ' + rl2, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ rl2, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, phead, y
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = rl + phead ', rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, r ≠ ps0[first].next, rl2 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2, vs, ps0, owns0), listp(first ' + rl2, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2, first, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ rl2, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1), ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), some?(ps0[phead].deqID), some?(vs[phead].deqID), weak?(owns0(vs[phead].next)), lst ∈ ps0, lst ∈ vs, vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, lst ∈ rl ∨ lst = phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl ∨ r = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
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 ∈ 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[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), some?(ps0[phead].deqID), some?(vs[phead].deqID), weak?(owns0(vs[phead].next)), lst ∈ ps0, lst ∈ vs, vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead, lst ∈ rl ∨ lst = phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl ∨ r = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
⊦ a ≠ b → st[b, d][a] = st[a]
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl ∨ r = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), phead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ first ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl ∨ r = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val |
vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ first ∈ rl, ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl ∨ r = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl + phead ', vs, ps0, owns0), listp(first ' + rl + phead ', vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[phead].deqID), some?(ps0[phead].deqID), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ first ∈ rl, ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl ∨ vhead0 = phead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, r ∈ rl1 ∨ r = first ∨ r ∈ rl ∨ r = phead, lst ∈ rl ∨ lst = phead, phead = vhead0 ∨ (first ' + rl).last = vhead0 ∧ phead0 ≠ phead ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[phead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], vs[qrl0.last].next ≠ null, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val |
vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[qrl0.last].next ≠ null, first ≠ lst, qrl0 ≠ [], r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val
| vs[vs[qrl0.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[qrl0.last].next ≠ null, first ≠ lst, qrl0 ≠ [], r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[qrl0.last].next ≠ null, first ≠ lst, qrl0 ≠ [], r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[qrl0.last].next ∈ ps0, vs[qrl0.last].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[qrl0.last].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps0[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), rl2 + qrl0 ≠ [], ps0[first].next ≠ null, vs[qrl0.last].next ≠ null, first ≠ lst, qrl0 ≠ [], r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), weak?(owns0(vs[qrl0.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, qrl0.last ∈ (rl1 + first ' + rl2) + qrl0 from lst, vs[qrl0.last].next ∈ ps0, vs[qrl0.last].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl0, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = vs[qrl0.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), vs[(phead ' + rl).last].next ∈ vs, vs[(phead ' + rl).last].next ∈ ps0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val
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 = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), vs[(phead ' + rl).last].next ∈ vs, vs[(phead ' + rl).last].next ∈ ps0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val |
⊦ y ≠ [] → (x + y).last = y.last
ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[(phead ' + rl).last].next ∈ ps0, vs[(phead ' + rl).last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val
ps0[phead].deqID = None, vs[vs[rl.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl.last].next].next = null, ps0[vs[rl.last].next] = vs[vs[rl.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[rl.last].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[rl.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl.last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[rl.last].next ∈ ps0, vs[rl.last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next = vs[rl.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val
Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[phead].deqID = None, vs[vs[(phead ' + rl).last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[(phead ' + rl).last].next].next = null, ps0[vs[(phead ' + rl).last].next] = vs[vs[(phead ' + rl).last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[(phead ' + rl).last].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[(phead ' + rl).last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, (phead ' + rl).last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[(phead ' + rl).last].next ∈ ps0, vs[(phead ' + rl).last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next = vs[(phead ' + rl).last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next] .val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][(phead ' + rl).last].next].val |
ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[phead].next)), vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
Used simplifier rules: ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s)
| ps0[phead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[phead].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), weak?(owns0(vs[phead].next)), vs[phead].next ∈ vs, vs[phead].next ∈ ps0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, phead = ps0[first].next, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val
vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val
Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), phead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, phead = ps0[first].next, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][phead].next].val |
ps0[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + ps0[first].next ', vs, ps0, owns0), listp(first ' + rl2 + ps0[first].next ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[ps0[first].next].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, ps0[first].next ∈ rl1 + first ' + rl2 + ps0[first].next ' from lst, vs[ps0[first].next].next ∈ ps0, vs[ps0[first].next].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2, lst ∈ rl2 ∨ lst = ps0[first].next, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s)
| ps0[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ lst, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + ps0[first].next ', vs, ps0, owns0), listp(first ' + rl2 + ps0[first].next ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[ps0[first].next].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, ps0[first].next ∈ rl1 + first ' + rl2 + ps0[first].next ' from lst, vs[ps0[first].next].next ∈ ps0, vs[ps0[first].next].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ ps0[first].next ∈ rl1, ¬ ps0[first].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2, lst ∈ rl2 ∨ lst = ps0[first].next, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[ps0[first].next].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[phead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[phead].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[phead].next ≠ null, first ≠ lst, first ≠ phead, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[phead].next = vs[phead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val = vs[vs[phead].next].val |
ps0[phead].deqID = None, vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ phead ∈ rl1, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| ps0[phead].deqID = None, vs[vs[phead].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[phead].next].next = null, ps0[vs[phead].next] = vs[vs[phead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[phead].next].val ≠ vs[vs[phead].next].val, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ', vs, ps0, owns0), listp(first ' + rl2 + phead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), weak?(owns0(vs[phead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, phead ∈ rl1 + first ' + rl2 + phead ' from lst, vs[phead].next ∈ ps0, vs[phead].next ∈ vs, ¬ dups(rl2), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ phead ∈ rl1, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead, (first ' + rl2).last = vhead0 ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None, lst ∈ rl2 ∨ lst = phead, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[phead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[phead].deqID = None, vs[vs[rl.last].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[rl.last].next].next = null, ps0[vs[rl.last].next] = vs[vs[rl.last].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[rl.last].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[rl.last].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl.last ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vs[rl.last].next ∈ ps0, vs[rl.last].next ∈ vs, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next = vs[rl.last].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][rl.last].next].val |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = rl0 + vhead ', rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead, y
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl = rl0 + vhead ', rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, r ≠ ps0[first].next, rl ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl, vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl, first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val |
ps0[phead].deqID = None, vs[vs[vhead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[vhead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vs[vhead].next ∈ ps0, vs[vhead].next ∈ vs, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val
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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[phead].deqID = None, vs[vs[vhead].next].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, ps0[vhead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vs[vhead].next ∈ ps0, vs[vhead].next ∈ vs, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val |
⊦ a ≠ b → st[b, d][a] = st[a]
ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead = ps0[first].next, ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val
ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val = vs[vs[vhead].next].val
Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vhead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead = ps0[first].next, ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val = vs[vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead].next].val |
vs[vs[ps0[first].next].next].deqID = None, ps0[phead].deqID = None, ps0[ps0[first].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[ps0[first].next].next)), vs[ps0[first].next].next ∈ vs, vs[ps0[first].next].next ∈ ps0, ps0[first].next ∈ rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ ps0[first].next ∈ rl0, ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = ps0[first].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s)
| vs[vs[ps0[first].next].next].deqID = None, ps0[phead].deqID = None, ps0[ps0[first].next].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[ps0[first].next].next].next = null, ps0[vs[ps0[first].next].next] = vs[vs[ps0[first].next].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next].next].val ≠ vs[vs[ps0[first].next].next].val, first ≠ ps0[first].next, first ≠ phead, first ≠ lst, phead ≠ ps0[first].next, r ≠ ps0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[ps0[first].next].next)), vs[ps0[first].next].next ∈ vs, vs[ps0[first].next].next ∈ ps0, ps0[first].next ∈ rl1 + first ' + rl2 + phead ' + rl0 + ps0[first].next ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ ps0[first].next ∈ rl0, ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0, lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = ps0[first].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[ps0[first].next].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[vhead].deqID = None, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[vhead].next ≠ null, first ≠ lst, first ≠ phead, first ≠ vhead, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead ∈ rl2, ¬ phead ∈ rl0, ¬ phead ∈ rl1, ¬ first ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ vs[vhead].next = vs[vhead].next ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val = vs[vs[vhead].next].val |
vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vhead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val ≠ vs[vs[vhead].next].val, first ≠ vhead, first ≠ phead, first ≠ lst, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ vhead ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| vs[vs[vhead].next].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs[ps0[first].next].deqID = None, vs[vs[vhead].next].next = null, ps0[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vhead].next ≠ null, ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[vhead].next].val ≠ vs[vs[vhead].next].val, first ≠ vhead, first ≠ phead, first ≠ lst, phead ≠ vhead, r ≠ ps0[first].next, tid ≠ tid0, vhead ≠ ps0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), listp(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + rl2 + phead ' + rl0 + vhead ', first, vs), nonullRetRefs(rl1 + first ' + rl2 + phead ' + rl0 + vhead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps0), weak?(owns0(vs[vhead].next)), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps0, vhead ∈ rl1 + first ' + rl2 + phead ' + rl0 + vhead ' from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl0, ¬ phead ∈ rl1, ¬ phead ∈ rl0, ¬ phead ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ vhead ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst ∈ rl2 ∨ lst = phead ∨ lst ∈ rl0 ∨ lst = vhead, (first ' + rl2).last = vhead0 ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs[phead].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead].deqID = None, r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r = phead ∨ r ∈ rl0 ∨ r = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), vs[vhead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalowns(vs, ps0, owns0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.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))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid0) ∨ owns0(r) = Weak(tid0) ∧ owns0(r) ≠ None) → r ∈ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] ∧ r ∈ ps0 ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r] = vs[r] ∧ (ps0[r].next = ps0[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps0[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps0[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns0(r)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: ps0, ps0, tid0, owns0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], owns0, 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)) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid0) ∨ owns0(r) = Weak(tid0) ∧ owns0(r) ≠ None) → r ∈ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)] ∧ r ∈ ps0 ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r] = vs[r] ∧ (ps0[r].next = ps0[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps0[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps0[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns0(r)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
vs[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r] ≠ vs[r], first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, r ∈ ps0, r ∈ vs, r ∈ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns0(r) = Some(tid0) ∨ owns0(r) = Weak(tid0) ∧ owns0(r) ≠ None ⊦
Used simplifier rules: ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| vs[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r] ≠ vs[r], first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, r ∈ ps0, r ∈ vs, r ∈ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns0(r) = Some(tid0) ∨ owns0(r) = Weak(tid0) ∧ owns0(r) ≠ None ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r = ps0[first].next, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r] ≠ vs[r], first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), r ∈ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], r ∈ vs, r ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(r) = Some(tid0) ∨ owns0(r) = Weak(tid0) ∧ owns0(r) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r = ps0[first].next, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r] ≠ vs[r], first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), r ∈ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], r ∈ vs, r ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(r) = Some(tid0) ∨ owns0(r) = Weak(tid0) ∧ owns0(r) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
vs[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID:= Some(tid) ≠ vs[ps0[first].next], ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None ⊦
Used simplifier rules: ⊦ a ∈ st[a, d]; (s) ⊦ a = b → st[b, d][a] = d; (s)
| vs[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID:= Some(tid) ≠ vs[ps0[first].next], ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None ⊦ |
vs[ps0[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp0 = dom prvHp0, opttid = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID:= Some(tid) ≠ vs[ps0[first].next], ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ (val = nd.val ∧ opttid = nd.deqID) ∧ nxt = nd.next ↔ nd = mk(val, opttid, nxt); (elim) Used terms: vs[ps0[first].next], val, opttid, nxt
| vs[ps0[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp0 = dom prvHp0, opttid = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[ps0[first].next].deqID:= Some(tid) ≠ vs[ps0[first].next], ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ mk(val, opttid, nxt).deqID:= opttid0 = mk(val, opttid0, nxt); (s)
| vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), listp(orl0 + qrl0, vs, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs, ps0, owns0)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None ⊦
Used terms: ps0, orl0, owns0, first, qrl0, vs
| ⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)) |
| vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), listp(orl0 + qrl0, vs, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs, ps0, owns0)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None ⊦ |
vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ 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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)
| vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None ⊦ |
vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ ¬ some?(None); (s)
| vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ |
vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl0, vs, ps0, owns0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ 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] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl0, vs, ps0, owns0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ps0[first].next ∈ ps0, ps0[first].next ∈ vs, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs) ⊦ |
vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), listp(first ' + qrl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, lst ∈ vs, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), (qrl0 ≠ [] → unmarkedp(rl, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| vs[ps0[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), listp(first ' + qrl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), ps0[first].next ∈ vs, ps0[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, lst ∈ vs, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), (qrl0 ≠ [] → unmarkedp(rl, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs), owns0(ps0[first].next) = Some(tid0) ∨ owns0(ps0[first].next) = Weak(tid0) ∧ owns0(ps0[first].next) ≠ None, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, vs[vs[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), vs[first].next ∈ vs, vs[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, owns0(vs[first].next) = Some(tid0) ∨ owns0(vs[first].next) = Weak(tid0) ∧ owns0(vs[first].next) ≠ None, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
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 ⊦ mk(val, opttid, nxt).deqID = opttid; (s) 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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, vs[vs[first].next] = mk(invENQvalue, None, nxt), dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), vs[first].next ∈ vs, vs[first].next ∈ ps0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, owns0(vs[first].next) = Some(tid0) ∨ owns0(vs[first].next) = Weak(tid0) ∧ owns0(vs[first].next) ≠ None, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) 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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ None ≠ Some(tid); (s) ⊦ unmarkedp([], vs); (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) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ rvownsrely(tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ↔ (∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?)
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ rvref. ¬ ( rvref ∈ vrvHp0 → rvowns(rvref) = rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))(rvref) ∨ tid0 ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))(rvref).tid ∧ rvowns(rvref).pending?), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: tid0, rvowns, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val)), vrvHp0
| ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ↔ (∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ rvref. ¬ ( rvref ∈ vrvHp0 → rvowns(rvref) = rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))(rvref) ∨ tid0 ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))(rvref).tid ∧ rvowns(rvref).pending?), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], rvowns(rvref) ≠ (vretRefs0(tid) = rvref ⊃ Claimed(tid, vs[ps0[first].next].val);rvowns(rvref)), tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), rvref ∈ vrvHp0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ tid0 ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = (vretRefs0(tid) = rvref ⊃ Claimed(tid, vs[ps0[first].next].val);rvowns(rvref)).tid ∧ rvowns(rvref).pending?
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], rvowns(rvref) ≠ (vretRefs0(tid) = rvref ⊃ Claimed(tid, vs[ps0[first].next].val);rvowns(rvref)), tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), rvref ∈ vrvHp0, first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ tid0 ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = (vretRefs0(tid) = rvref ⊃ Claimed(tid, vs[ps0[first].next].val);rvowns(rvref)).tid ∧ rvowns(rvref).pending? |
Used simplifier rules: ⊦ Claimed(tid, val).tid = tid; (s) ⊦ Pending(tid) ≠ Claimed(tid0, val); (s) ⊦ Pending(tid).tid = tid; (s) ⊦ Pending(tid).pending?; (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬(noid(tid0, orl0 + qrl0, r, vs) → noid(tid0, orl0 + qrl0, r, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: orl0 + qrl0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], orl0 + qrl0, vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬(noid(tid0, orl0 + qrl0, r, vs) → noid(tid0, orl0 + qrl0, r, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid0, orl0 + qrl0, r, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, r0 ∈ orl0 + qrl0 from r, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.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)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid0, orl0 + qrl0, r, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, r0 ∈ orl0 + qrl0 from r, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), r0 ∈ orl0 + qrl0 from r, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r0. r0 ≠ r ∧ r0 ∈ orl0 + qrl0 from r → vs[r0].deqID ≠ Some(tid0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: tid0, orl0 + qrl0, r, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), r0 ∈ orl0 + qrl0 from r, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r0. r0 ≠ r ∧ r0 ∈ orl0 + qrl0 from r → vs[r0].deqID ≠ Some(tid0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, r0 ∈ orl0 + qrl0 from r, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r0. r0 ≠ r ∧ r0 ∈ orl0 + qrl0 from r → vs[r0].deqID ≠ Some(tid0), ∀ r0. r0 ≠ first ∧ r0 ∈ orl0 + qrl0 from first → vs[r0].deqID ≠ Some(tid), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: tid, orl0 + qrl0, first, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, r0 ∈ orl0 + qrl0 from r, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r0. r0 ≠ r ∧ r0 ∈ orl0 + qrl0 from r → vs[r0].deqID ≠ Some(tid0), ∀ r0. r0 ≠ first ∧ r0 ∈ orl0 + qrl0 from first → vs[r0].deqID ≠ Some(tid), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), r0 ∈ orl0 + qrl0 from r, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r0. r0 ≠ r ∧ r0 ∈ orl0 + qrl0 from r → vs[r0].deqID ≠ Some(tid0), ∀ r1. r1 ≠ first ∧ (r1 ∈ orl0 from first ∨ r1 ∈ qrl0) → vs[r1].deqID ≠ Some(tid), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s)
| vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][r0].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[r0].deqID ≠ Some(tid0), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), r0 ∈ orl0 + qrl0 from r, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r0. r0 ≠ r ∧ r0 ∈ orl0 + qrl0 from r → vs[r0].deqID ≠ Some(tid0), ∀ r1. r1 ≠ first ∧ (r1 ∈ orl0 from first ∨ r1 ∈ qrl0) → vs[r1].deqID ≠ Some(tid), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) Used terms: vs, ps0[first].next, vs[ps0[first].next].deqID:= Some(tid), r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottidRely(tid0, vhead0, vs, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0)
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: vhead0, vhead0, tid0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vs
| ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: tid0, vhead0, vs
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: tid0, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), listp(orl0 + qrl0, vs, ps0, owns0) ∧ first ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2, vs, ps0, owns0)), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: ps0, orl0 + qrl0, owns0, first, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), listp(orl0 + qrl0, vs, ps0, owns0) ∧ first ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2, vs, ps0, owns0)), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + first ' + rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), listp(first ' + rl2, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x → a ∈ x + y; (s)
| orl0 + qrl0 = rl1 + first ' + rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), listp(first ' + rl2, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
orl0 + qrl0 = rl1 + first ' + rl2, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(first ' + rl2, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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)
| orl0 + qrl0 = rl1 + first ' + rl2, (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(first ' + rl2, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), vs[vs[first].next].deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl ∧ nxt = ps[first].next ∧ nxt ≠ null → (nxt ∈ vs ↔ true); (ss) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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 = a ' + x; (s)
| orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), vs[vs[first].next].deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next].deqID = None, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead0 = vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None ⊦
orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next].deqID = None, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vhead0].next].deqID = Some(tid0), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None ⊦
Used terms: vs, vs[first].next, vs[vs[first].next].deqID:= Some(tid), vhead0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next].deqID = None, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID = Some(tid0), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead0 = vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None ⊦ |
orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next].deqID = None, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next].next].deqID = Some(tid0), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[vs[first].next].next].deqID ≠ Some(tid0), vs[first].next ≠ null, vs[vs[first].next].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vs[first].next, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vs[first].next ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vs[vs[first].next].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vs[first].next].next].deqID.tid)) = Claimed(vs[vs[vs[first].next].next].deqID.tid, vs[vs[vs[first].next].next].val), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None, orl0.last = vs[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vs[first].next ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s)
| orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next].deqID = None, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next].next].deqID = Some(tid0), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[vs[first].next].next].deqID ≠ Some(tid0), vs[first].next ≠ null, vs[vs[first].next].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vs[first].next, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vs[first].next ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vs[vs[first].next].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vs[first].next].next].deqID.tid)) = Claimed(vs[vs[vs[first].next].next].deqID.tid, vs[vs[vs[first].next].next].val), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None, orl0.last = vs[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vs[first].next ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) Used terms: vs, vs[first].next, vs[vs[first].next].deqID:= Some(tid), vs[vs[first].next].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next].deqID = None, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vhead0].next].deqID = Some(tid0), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None ⊦ |
orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vhead0].next].deqID = Some(tid0), vs[vs[first].next].deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
| orl0 + qrl0 = rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vhead0].next].deqID = Some(tid0), vs[vs[first].next].deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null, vs[first].next ≠ null, first ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(orl0 + qrl0, vs, ps0, owns0), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, first, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs, first ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[first].deqID = vs[first].deqID ∨ ps0[first].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) Used terms: vs, vs[first].next, vs[vs[first].next].deqID:= Some(tid), vs[vhead0].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (ps ⊕ vs)[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) 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 ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, 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) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 from first ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 from first ∨ lst ∈ qrl0 ⊦
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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 from first ∨ lst ∈ qrl0 ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl ⊦
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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (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) ⊦ a ' + x ≠ []; (s)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl ⊦ |
⊦ r ∈ rl → r ∈ rl from r
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (orl0 + (phead ' + orl).butlast).last, orl0 + phead ' + orl
| ⊦ r ∈ rl → r ∈ rl from r |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 from first ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ phead, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl ∨ lst ∈ orl0 from first ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ phead, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl ∨ lst ∈ orl0 from first ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + phead ' + orl.butlast).last ≠ phead, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: phead ', orl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (orl0 + phead ' + orl.butlast).last ≠ phead, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (phead ' + orl.butlast).last ≠ phead, (phead ' + orl.butlast).last ≠ orl.last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl ∨ lst ∈ orl0 from first ⊦
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)
| ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (phead ' + orl.butlast).last ≠ phead, (phead ' + orl.butlast).last ≠ orl.last, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from lst, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl, ¬ (phead ' + orl.butlast).last ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl ∨ lst ∈ orl0 from first ⊦ |
vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ phead, (phead ' + orl1).last ≠ vhead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl1).last ∈ orl, ¬ (phead ' + orl1).last ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead, y
| vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ phead, (phead ' + orl1).last ≠ vhead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ phead ∈ orl0, ¬ phead ∈ orl, ¬ (phead ' + orl1).last ∈ orl, ¬ (phead ' + orl1).last ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl ∨ lst ∈ orl0 from first, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[vhead].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, lst ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', first, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ (phead ' + orl1).last ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ (phead ' + orl1).last ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl0 from first ∨ lst ∈ orl1 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (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) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[vhead].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, first ≠ lst, lst ≠ phead, lst ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', first, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from lst, vhead0 ∈ orl0 from first, first ∈ orl0, phead0 ∈ orl0, first ∈ ps0, phead0 ∈ ps0, first ∈ vs0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ (phead ' + orl1).last ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ (phead ' + orl1).last ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl0 from first ∨ lst ∈ orl1 ⊦ |
⊦ 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: phead ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, first ∈ orl0, vhead0 ∈ orl0 from first, vtail0 ∈ orl0 + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, first ∈ vs0, phead0 ∈ ps0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 from first ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
⊦ r ∈ rl → r ∈ rl from r
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0, orl0 + qrl0
| ⊦ r ∈ rl → r ∈ rl from r |
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.