[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof step-D28-D29 (conclusion) (back to tree)

⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.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 ≠ 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) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → ( lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl ∧ gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D28, a).nxt ≠ null ∧ lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next ∧ gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed(lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs) ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps) ∧ gstepf(gs, ls, D28, a).orl ≠ [] ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl ∧ rvownerok(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp) ∧ dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp ∧ ( gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid, gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ (gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs)) ∧ ( gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D28, a).vs[(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D28, a).success ∧ gstepf(gs, ls, D28, a).rvowns(gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid)) ∧ ( gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).addr ≠ null ∧ lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noid (lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-D28-D29 (previous step) (back to tree)

gs.vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D28, a) = D29, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D28, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, ls.addr ∈ 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 ⊦ ( lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl ∧ gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D28, a).nxt ≠ null ∧ lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next ∧ gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed(lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs) ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps) ∧ gstepf(gs, ls, D28, a).orl ≠ [] ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl ∧ rvownerok(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp) ∧ dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp ∧ ( gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid, gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ (gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs)) ∧ ( gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D28, a).vs[(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D28, a).success ∧ gstepf(gs, ls, D28, a).rvowns(gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid)) ∧ ( gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).addr ≠ null ∧ lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, D28, a) = ( ( gs .ps:= gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ lstepf(gs, ls, D28, a) = ls; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ None ≠ Some(tid); (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pcstepf(gs, ls, D28, a) = D29; (s)

Proof step 3 from proof step-D28-D29 (previous step) (back to tree)

gs.vs[ls.nxt].deqID = Some(ls.othertid), 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.rvowns(ls.addr) = Claimed(ls.othertid, gs.vs[ls.nxt].val), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, 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), ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ls.addr ∈ 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) ⊦ ls.first ∈ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) ∧ ls.nxt = gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)][ls.first].next ∧ listp ((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl), gs.vs, gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)], gs.owns) ∧ ¬ dups((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl)) ∧ markedp((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl), gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ markedp((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl), gs.vs) ∧ unmarkedp((gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl), gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) ≠ [] ∧ gs.phead ∈ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) ∧ nonullRetRefs ((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl).last = gs.vhead ∧ ((gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl) ≠ [] → unmarkedp((gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl).tail, gs.vs)) ∨ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl).butlast ≠ [] ∧ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl).butlast.last = gs.vhead ∧ gs.phead ≠ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl).last ∧ unmarkedp((gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl), gs.vs)) ∧ ( gs.vtail = ((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl)).last ∨ (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl) ≠ [] ∧ gs.vtail = ((gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl).butlast).last ∧ gs.vs[(gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl).last].deqID = None ∧ gs.vs[(gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl).last].next = null) ∧ noid(ls.tid, (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl), gs.vhead, gs.vs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

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

Proof step 4 from proof step-D28-D29 (previous step) (back to tree)

vs[ls.nxt].deqID = Some(ls.othertid), 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.addr) = Claimed(ls.othertid, vs[ls.nxt].val), rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.addr ∈ vrvHp, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, phead ∈ orl, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ 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 ⊦ ls.first ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) ∧ ls.nxt = ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)][ls.first].next ∧ listp ((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs, ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)], owns) ∧ ¬ dups((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl), ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ markedp((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).last = vhead ∧ ((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl)).last ∨ (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).butlast).last ∧ vs[(ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid(ls.tid, (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 5 from proof step-D28-D29 (previous step) (back to tree)

vs[ls.nxt].deqID = Some(ls.othertid), 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), rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ls.addr ∈ vrvHp, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ 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) ⊦ ls.first ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) ∧ ls.nxt = ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)][ls.first].next ∧ listp ((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs, ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)], owns) ∧ ¬ dups((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl), ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ markedp((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).last = vhead ∧ ((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl)).last ∨ (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ((ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).butlast).last ∧ vs[(ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid(ls.tid, (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval]

Additional information

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

Proof step 6 from proof step-D28-D29 (previous step) (back to tree)

vs[nxt].deqID = Some(othertid), 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(addr) = Claimed(othertid, vs[nxt].val), rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, addr ≠ null, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, addr ∈ vrvHp, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ 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 ⊦ first ∈ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) ∧ nxt = ps[nxt, ps[nxt].deqID:= Some(othertid)][first].next ∧ listp((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl), vs, ps[nxt, ps[nxt].deqID:= Some(othertid)], owns) ∧ ¬ dups((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl), ps[nxt, ps[nxt].deqID:= Some(othertid)]) ∧ markedp((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((ps[nxt].deqID = None ⊃ qrl.tail;qrl), ps[nxt, ps[nxt].deqID:= Some(othertid)]) ∧ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl).last = vhead ∧ ((ps[nxt].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[nxt].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((ps[nxt].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl)).last ∨ (ps[nxt].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ((ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl).butlast).last ∧ vs[(ps[nxt].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[nxt].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid(tid, (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 7 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ 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) ⊦ first ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) ∧ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp ((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).last = vhead ∧ ((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)).last ∨ (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).butlast).last ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid(tid, (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix1, seq:⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)), subst:[ps, rl, owns, r, rl0, vs] → [ps, orl, owns, first, qrl, vs]

Additional information

Used terms: ps, orl, owns, first, qrl, vs

Proof step 8 from proof step-D28-D29 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))

A spec-lemma

Proof step 9 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], 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, vhead, 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, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ 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), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), 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 ⊦ first ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) ∧ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp ((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl), vs) ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) ≠ [] ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) ∧ nonullRetRefs((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).last = vhead ∧ ((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).butlast ≠ [] ∧ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).butlast.last = vhead ∧ phead ≠ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl).last ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)).last ∨ (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ((ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).butlast).last ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid(tid, (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ 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) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ 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)

Proof step 10 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ first ∈ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ∧ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2), vs) ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ≠ [] ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ∧ nonullRetRefs ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).last = vhead ∧ ((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).butlast ≠ [] ∧ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).butlast.last = vhead ∧ phead ≠ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).last ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ).last ∨ (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid (tid, (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ps[ps[first].next].deqID = None

Additional information

Used formulas: ps[ps[first].next].deqID = None

Proof step 11 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ first ∈ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ∧ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2), vs) ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ≠ [] ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ∧ nonullRetRefs ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).last = vhead ∧ ((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).butlast ≠ [] ∧ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).butlast.last = vhead ∧ phead ≠ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).last ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ).last ∨ (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid (tid, (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ').last = a; (s) ⊦ (x + a ').butlast = x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' ≠ []; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 12 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].deqID) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), first], <all paths>

Additional information

Used simplifier rules: ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ some?(Some(tid)); (s) ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), first

Proof step 13 from proof step-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 14 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[first].next = ps[first].next ∧ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[first].deqID) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-settid, seq:⊦ r ∈ rl ∧ r ∈ ps ∧ ps[r].deqID = None ∧ vs[r].deqID = Some(tid) → ( listp(rl, vs, ps[r, ps[r].deqID:= Some(tid)], owns) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, tid, owns, r, vs] → [ps, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, othertid, owns, ps[first].next, vs], <all paths>

Additional information

Used terms: ps, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, othertid, owns, ps[first].next, vs

Proof step 16 from proof step-D28-D29 (previous step) (back to tree)

⊦ r ∈ rl ∧ r ∈ ps ∧ ps[r].deqID = None ∧ vs[r].deqID = Some(tid) → (listp(rl, vs, ps[r, ps[r].deqID:= Some(tid)], owns) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 17 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs), ps[first].next ∈ ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail ∧ ps[first].next ∈ ps ∧ ps[ps[first].next].deqID = None ∧ vs[ps[first].next].deqID = Some(othertid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

Proof step 18 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs), (ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = qrl.head ∨ ps[first].next ∈ qrl.tail) ∧ ps[first].next ∈ ps

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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(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) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ some?(Some(tid)); (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] ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ some?(opttid) → opttid ≠ None; (as)

Proof step 19 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = qrl.head ∨ ps[first].next ∈ qrl.tail) ∧ ps[first].next ∈ ps, listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 '.last = a; (s) ⊦ x + [] = x; (s) ⊦ markedp([], vs); (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s)

Proof step 20 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl1, 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), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(rl1 + first ' + qrl.head ' + qrl.tail, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(rl1 + first ' + qrl.head ' + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead = qrl.head) ∧ nonullRetRefs(rl1 + first ' + qrl.head ' + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ first = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, rl1 + first ' + qrl.head ' + qrl.tail, vhead, vs), (ps[first].next ∈ rl1 ∨ ps[first].next = qrl.head ∨ ps[first].next ∈ qrl.tail) ∧ ps[first].next ∈ ps

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, phead0, qrl0]

Additional information

Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead0, y

Proof step 21 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + qrl0, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first, first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs) ⊦ (ps[first].next ∈ rl1 ∨ ps[first].next = phead0 ∨ ps[first].next ∈ qrl0) ∧ ps[first].next ∈ ps, listp(rl1 + first ' + phead0 ' + qrl0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(rl1 + first ' + phead0 ' + qrl0) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][phead0].deqID) ∧ some?(vs[phead0].deqID) ∧ unmarkedp(qrl0, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead = phead0) ∧ nonullRetRefs(rl1 + first ' + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (phead0 = vhead ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ first = vhead ∧ phead ≠ phead0 ∧ unmarkedp(qrl0, vs)) ∧ (vtail = (phead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (phead0 ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null) ∧ noid(tid, rl1 + first ' + phead0 ' + qrl0, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) 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 ⊦ some?(Some(tid)); (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a + x = a ' + x; (s) ⊦ 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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)

Proof step 22 from proof step-D28-D29 (previous step) (back to tree)

∅[vs[vhead].next].deqID = None, vs[vs[vhead].next].deqID = Some(othertid), ps[vhead].deqID = vs[vhead].deqID, ps[vhead].next = vs[vhead].next, ps[vhead].val = vs[vhead].val, dom vrvHp = dom prvHp, owns(vhead) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[vhead].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(othertid)) = Claimed(othertid, vs[vs[vhead].next].val), vs[vhead].next ≠ null, addr ≠ null, vhead ≠ null, vhead ≠ lst, vhead ≠ vs[vhead].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vhead].next ' + qrl0, vs, ps, owns), listp(rl1 + vhead ' + vs[vhead].next ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead ' + vs[vhead].next ' + qrl0, vhead, vs), nonullRetRefs(rl1 + vhead ' + vs[vhead].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), lst ∈ qrl0, lst ∈ ps, lst ∈ vs, vhead ∈ ps, vhead ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + vhead ' + vs[vhead].next ' + qrl0 from lst, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ weak?(vs[vhead].deqID), ¬ vs[vhead].next ∈ ps, ¬ vhead ∈ qrl0, ¬ vs[vhead].next ∈ qrl0, ¬ vs[vhead].next ∈ rl1, ¬ vhead ∈ rl1, vtail = qrl0.last ∨ vtail = (vhead ' + (vs[vhead].next ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead ∈ rl1 ∨ phead = vhead ⊦ listp(rl1 + vhead ' + vs[vhead].next ' + qrl0, vs, ps[vs[vhead].next, ∅[vs[vhead].next].deqID:= Some(othertid)], owns) ∧ ¬ dups(rl1 + vhead ' + vs[vhead].next ' + qrl0) ∧ (vtail = qrl0.last ∨ qrl0 ≠ [] ∧ vtail = (vs[vhead].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ ¬ a ∈ []; (s)

Proof step 23 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ps[first].next ∈ ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, ps[first].next ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

Proof step 24 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), ps[first].next ∈ ps, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = qrl.head ∨ ps[first].next ∈ qrl.tail ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 25 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ps[first].next ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = qrl.head ∨ ps[first].next ∈ qrl.tail, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)

Proof step 26 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ ps[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2, vs, ps, owns), listp(rl1 + first ' + rl2, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2, vhead, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), lst ∈ ps, lst ∈ vs, lst ∈ rl2, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, rl2.last ∈ rl1 + first ' + rl2 from lst, ps[first].next ∈ ps, ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ dups(rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, 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), rl2.last = vhead ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ rl2.last, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = [].head ∨ ps[first].next ∈ [].tail, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ listp(((rl1 + first ' + rl2) + [].head ') + [].tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl2) + [].head ') + [].tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][[].head].deqID) ∧ some?(vs[[].head].deqID) ∧ unmarkedp([].tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = [].head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + [].head ') + [].tail, vs, vretRefs, pretRefs) ∧ ([].head = vhead ∧ ([].tail ≠ [] → unmarkedp([].tail.tail, vs)) ∨ rl2.last = vhead ∧ phead ≠ [].head ∧ unmarkedp([].tail, vs)) ∧ ( rl2.last = ([].head ' + [].tail).last ∨ [].tail ≠ [] ∧ rl2.last = ([].head ' + [].tail.butlast).last ∧ vs[[].tail.last].deqID = None ∧ vs[[].tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + [].head ') + [].tail, vhead, vs)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl2, phead0, rl]

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, phead0, y

Proof step 27 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = rl + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ ps[first].next, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + rl2, vs, ps, owns), listp(first ' + rl2, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2, vhead, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), ps[first].next ∈ ps, phead0 ∈ rl1 + first ' + rl2 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ rl2, lst ∈ vs, lst ∈ ps, ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ dups(rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = [].head ∨ ps[first].next ∈ [].tail, phead0 = vhead ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ phead0 ⊦ listp(((rl1 + first ' + rl2) + [].head ') + [].tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl2) + [].head ') + [].tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][[].head].deqID) ∧ some?(vs[[].head].deqID) ∧ unmarkedp([].tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = [].head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + [].head ') + [].tail, vs, vretRefs, pretRefs) ∧ ([].head = vhead ∧ ([].tail ≠ [] → unmarkedp([].tail.tail, vs)) ∨ phead0 = vhead ∧ phead ≠ [].head ∧ unmarkedp([].tail, vs)) ∧ ( phead0 = ([].head ' + [].tail).last ∨ [].tail ≠ [] ∧ phead0 = ([].head ' + [].tail.butlast).last ∧ vs[[].tail.last].deqID = None ∧ vs[[].tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + [].head ') + [].tail, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ some?(opttid) → opttid ≠ None; (as) 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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ').butlast = x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 28 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, ps[first].next ≠ phead0, addr ≠ null, first ≠ phead0, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + rl + phead0 ', vs, ps, owns), listp(first ' + rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + first ' + rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), ps[first].next ∈ ps, phead0 ∈ rl1 + first ' + rl + phead0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ (first ' + rl).last = vhead ∧ phead ≠ phead0, lst ∈ rl ∨ lst = phead0, ps[first].next ∈ [].tail ∨ ps[first].next = [].head ∨ ps[first].next ∈ rl ∨ ps[first].next ∈ rl1 ⊦ listp(((rl1 + first ' + rl + phead0 ') + [].head ') + [].tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl + phead0 ') + [].head ') + [].tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][[].head].deqID) ∧ some?(vs[[].head].deqID) ∧ unmarkedp([].tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl ∨ phead = phead0 ∨ phead = [].head) ∧ nonullRetRefs(((rl1 + first ' + rl + phead0 ') + [].head ') + [].tail, vs, vretRefs, pretRefs) ∧ ([].head = vhead ∧ ([].tail ≠ [] → unmarkedp([].tail.tail, vs)) ∨ phead0 = vhead ∧ phead ≠ [].head ∧ unmarkedp([].tail, vs)) ∧ ( phead0 = ([].head ' + [].tail).last ∨ [].tail ≠ [] ∧ phead0 = ([].head ' + [].tail.butlast).last ∧ vs[[].tail.last].deqID = None ∧ vs[[].tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl + phead0 ') + [].head ') + [].tail, vhead, vs)

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ some?(Some(tid)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = 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] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s)

Proof step 29 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = first0 + qrl0, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ps[first].next ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = qrl.head ∨ ps[first].next ∈ qrl.tail, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, ps, owns) ∧ ¬ dups(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][qrl.head].deqID) ∧ some?(vs[qrl.head].deqID) ∧ unmarkedp(qrl.tail, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = qrl.head) ∧ nonullRetRefs(((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vs, vretRefs, pretRefs) ∧ (qrl.head = vhead ∧ (qrl.tail ≠ [] → unmarkedp(qrl.tail.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ qrl.head ∧ unmarkedp(qrl.tail, vs)) ∧ ( vtail = (qrl.head ' + qrl.tail).last ∨ qrl.tail ≠ [] ∧ vtail = (qrl.head ' + qrl.tail.butlast).last ∧ vs[qrl.tail.last].deqID = None ∧ vs[qrl.tail.last].next = null) ∧ noid(tid, ((rl1 + first ' + rl2) + qrl.head ') + qrl.tail, vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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).tail = x; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (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)

Proof step 30 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, first ≠ first0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + rl2 + first0 ' + qrl0, vs, ps, owns), listp(first ' + rl2 + first0 ' + qrl0, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2 + first0 ' + qrl0, vhead, vs), nonullRetRefs(rl1 + first ' + rl2 + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps), ps[first].next ∈ ps, vtail ∈ rl1 + first ' + rl2 + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + rl2) + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(qrl0), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first0 ∈ rl2, ¬ first0 ∈ qrl0, ¬ first0 ∈ rl1, ¬ first ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = (first0 ' + qrl0).last ∨ vtail = (first ' + rl2 + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ rl2 ∨ lst = first0 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead ∧ unmarkedp(qrl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = first0 ∨ ps[first].next ∈ qrl0 ⊦ ¬ dups(rl1 + first ' + rl2 + first0 ' + qrl0) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first0].deqID) ∧ some?(vs[first0].deqID) ∧ unmarkedp(qrl0, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = first0) ∧ (first0 = vhead ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ first0 ∧ unmarkedp(qrl0, vs)) ∧ (vtail = (first0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (first0 ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), first0], <all paths>

Additional information

Used terms: ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), first0

Proof step 31 from proof step-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 32 from proof step-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, first0 = ps[first].next, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, first ≠ first0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + first0 ' + qrl0, vs, ps, owns), listp(rl1 + first ' + rl2 + first0 ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2 + first0 ' + qrl0, vhead, vs), nonullRetRefs(rl1 + first ' + rl2 + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + rl2 + first0 ' + qrl0 from lst, ps[first].next ∈ ps, ¬ dups((rl1 + rl2) + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(qrl0), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first0 ∈ rl2, ¬ first0 ∈ qrl0, ¬ first0 ∈ rl1, ¬ first ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = first0 ∨ ps[first].next ∈ qrl0, (first ' + rl2).last = vhead ∧ unmarkedp(qrl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (first ' + rl2 + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ¬ dups(rl1 + first ' + rl2 + first0 ' + qrl0) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first0].deqID) ∧ some?(vs[first0].deqID) ∧ unmarkedp(qrl0, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = first0) ∧ (first0 = vhead ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ first0 ∧ unmarkedp(qrl0, vs)) ∧ (vtail = (first0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (first0 ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s)

Proof step 33 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ ps[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + rl2 + ps[first].next ' + qrl0, vs, ps, owns), listp(first ' + rl2 + ps[first].next ' + qrl0, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (first ' + rl2).last, vs), noid(tid, rl1 + first ' + rl2 + ps[first].next ' + qrl0, (first ' + rl2).last, vs), nonullRetRefs(rl1 + first ' + rl2 + ps[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), ps[first].next ∈ ps, vtail ∈ rl1 + first ' + rl2 + ps[first].next ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + rl2) + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(qrl0), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl0, ¬ ps[first].next ∈ rl1, ¬ first ∈ qrl0, vs[(first ' + rl2).last].next ≠ null ∧ vs[vs[(first ' + rl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2).last].next].deqID.tid, vs[vs[(first ' + rl2).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = (ps[first].next ' + qrl0).last ∨ vtail = (first ' + rl2 + (ps[first].next ' + qrl0).butlast).last ∧ vs[(ps[first].next ' + qrl0).last].deqID = None ∧ vs[(ps[first].next ' + qrl0).last].next = null, lst ∈ rl2 ∨ lst = ps[first].next ∨ lst ∈ qrl0 ⊦ ¬ dups(rl1 + first ' + rl2 + ps[first].next ' + qrl0) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = ps[first].next) ∧ (ps[first].next = (first ' + rl2).last ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ phead ≠ ps[first].next) ∧ ( vtail = (ps[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (ps[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ 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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 34 from proof step-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ ps[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + ps[first].next ' + qrl0, vs, ps, owns), listp(rl1 + first ' + rl2 + ps[first].next ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (first ' + rl2).last, vs), noid(tid, rl1 + first ' + rl2 + ps[first].next ' + qrl0, (first ' + rl2).last, vs), nonullRetRefs(rl1 + first ' + rl2 + ps[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + rl2 + ps[first].next ' + qrl0 from lst, ps[first].next ∈ ps, ¬ dups((rl1 + rl2) + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(qrl0), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl0, ¬ ps[first].next ∈ rl1, ¬ first ∈ qrl0, vs[(first ' + rl2).last].next ≠ null ∧ vs[vs[(first ' + rl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2).last].next].deqID.tid, vs[vs[(first ' + rl2).last].next].val), lst ∈ rl2 ∨ lst = ps[first].next ∨ lst ∈ qrl0, vtail = (ps[first].next ' + qrl0).last ∨ vtail = (first ' + rl2 + (ps[first].next ' + qrl0).butlast).last ∧ vs[(ps[first].next ' + qrl0).last].deqID = None ∧ vs[(ps[first].next ' + qrl0).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ¬ dups(rl1 + first ' + rl2 + ps[first].next ' + qrl0) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = ps[first].next) ∧ (ps[first].next = (first ' + rl2).last ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ phead ≠ ps[first].next) ∧ ( vtail = (ps[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (ps[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (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) ⊦ markedp([], vs); (s)

Proof step 35 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(othertid)) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, addr ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl0, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, vs[first].next ∈ ps, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, lst = vs[first].next ∨ lst ∈ qrl0, vtail = (vs[first].next ' + qrl0).last ∨ vtail = (first ' + (vs[first].next ' + qrl0).butlast).last ∧ vs[(vs[first].next ' + qrl0).last].deqID = None ∧ vs[(vs[first].next ' + qrl0).last].next = null, phead ∈ rl1 ∨ phead = first ⊦ ¬ dups(rl1 + first ' + vs[first].next ' + qrl0) ∧ phead ≠ vs[first].next ∧ ( vtail = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (vs[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 36 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(othertid)) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, addr ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), dups(rl1 + first ' + vs[first].next ' + qrl0), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps, owns), listp(vs[first].next ' + qrl0, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), vs[first].next ∈ ps, vtail ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl0).last ∨ vtail = (first ' + (vs[first].next ' + qrl0).butlast).last ∧ vs[(vs[first].next ' + qrl0).last].deqID = None ∧ vs[(vs[first].next ' + qrl0).last].next = null, lst = vs[first].next ∨ lst ∈ qrl0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-nodups, seq: ⊦ listp(rl, vs, ps, owns) → ¬ dups(rl), subst:[owns, rl, vs, ps] → [owns, rl1 + first ' + vs[first].next ' + qrl0, vs, ps]

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: owns, rl1 + first ' + vs[first].next ' + qrl0, vs, ps

Proof step 37 from proof step-D28-D29 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) → ¬ dups(rl)

A spec-lemma

Proof step 38 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(othertid)) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, addr ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, vretRefs(tid) ≠ null, vtail ≠ (vs[first].next ' + qrl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps, owns), listp(vs[first].next ' + qrl0, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), vs[first].next ∈ ps, vtail ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl0).last ∨ vtail = (first ' + (vs[first].next ' + qrl0).butlast).last ∧ vs[(vs[first].next ' + qrl0).last].deqID = None ∧ vs[(vs[first].next ' + qrl0).last].next = null, lst = vs[first].next ∨ lst ∈ qrl0 ⊦ qrl0 ≠ [] ∧ vtail = (vs[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)

Proof step 39 from proof step-D28-D29 (previous step) (back to tree)

vs[(vs[first].next ' + qrl0).last].deqID = None, vs[vs[first].next].deqID = Some(othertid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs[(vs[first].next ' + qrl0).last].next = null, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(othertid)) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), (first ' + (vs[first].next ' + qrl0).butlast).last ≠ (vs[first].next ' + qrl0).last, vs[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ vs[first].next, first ≠ null, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps, owns), listp(vs[first].next ' + qrl0, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), vs[first].next ∈ ps, (first ' + (vs[first].next ' + qrl0).butlast).last ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ first ∈ qrl0, lst = vs[first].next ∨ lst ∈ qrl0, phead ∈ rl1 ∨ phead = first ⊦ qrl0 ≠ [] ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [vs[first].next ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (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) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs[first].next ', qrl0

Proof step 40 from proof step-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 41 from proof step-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, first ≠ first0, first0 ≠ ps[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + first0 ' + qrl0, vs, ps, owns), listp(rl1 + first ' + rl2 + first0 ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2 + first0 ' + qrl0, vhead, vs), nonullRetRefs(rl1 + first ' + rl2 + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + rl2 + first0 ' + qrl0 from lst, ps[first].next ∈ ps, ¬ dups((rl1 + rl2) + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(qrl0), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first0 ∈ rl2, ¬ first0 ∈ qrl0, ¬ first0 ∈ rl1, ¬ first ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next = first0 ∨ ps[first].next ∈ qrl0, (first ' + rl2).last = vhead ∧ unmarkedp(qrl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (first ' + rl2 + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ¬ dups(rl1 + first ' + rl2 + first0 ' + qrl0) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[first0].deqID) ∧ some?(vs[first0].deqID) ∧ unmarkedp(qrl0, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ∨ phead = first0) ∧ (first0 = vhead ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + rl2).last = vhead ∧ phead ≠ first0 ∧ unmarkedp(qrl0, vs)) ∧ (vtail = (first0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail = (first0 ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ some?(None); (s)

Proof step 42 from proof step-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ first0, first ≠ lst, first ≠ ps[first].next, first0 ≠ ps[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + first0 ' + qrl0, vs, ps, owns), listp(rl1 + first ' + rl2 + first0 ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2 + first0 ' + qrl0, vhead, vs), nonullRetRefs(rl1 + first ' + rl2 + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + rl2 + first0 ' + qrl0 from lst, ps[first].next ∈ ps, ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + rl2) + qrl0), ¬ first ∈ qrl0, ¬ first0 ∈ rl1, ¬ first0 ∈ qrl0, ¬ first0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, 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), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl0, (first ' + rl2).last = vhead ∧ unmarkedp(qrl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (first ' + rl2 + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl2

Additional information

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) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s)

Proof step 43 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ first ∈ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ∧ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ ¬ dups ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ markedp ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2), vs) ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ≠ [] ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) ∧ nonullRetRefs ((ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs, vretRefs, pretRefs) ∧ ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).last = vhead ∧ ((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] → unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).tail, vs)) ∨ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).butlast ≠ [] ∧ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).butlast.last = vhead ∧ phead ≠ (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2).last ∧ unmarkedp((ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)) ∧ ( vtail = ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ).last ∨ (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) ≠ [] ∧ vtail = ( (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).butlast ).last ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].deqID = None ∧ vs[(ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl).last].next = null) ∧ noid (tid, (ps[ps[first].next].deqID = None ⊃ (rl1 + first ' + rl2) + qrl.head ';rl1 + first ' + rl2) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vhead, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s)

Proof step 44 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp((rl1 + first ' + rl2) + qrl, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].deqID) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ unmarkedp(qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), first], <all paths>

Additional information

Used terms: ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), first

Proof step 45 from proof step-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 46 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, first = ps[first].next, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[first].next = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].next ∧ listp((rl1 + first ' + rl2) + qrl, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][first].deqID) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ unmarkedp(qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s)

Proof step 47 from proof step-D28-D29 (previous step) (back to tree)

vs[first].deqID = Some(othertid), dom vrvHp = dom prvHp, first = ps[first].next, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[first].val), ps[first].deqID ≠ None, addr ≠ null, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + first ' + rl2) + qrl, vs, ps[first, ps[first].deqID:= Some(othertid)], owns), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-settid, seq:⊦ r ∈ rl ∧ r ∈ ps ∧ ps[r].deqID = None ∧ vs[r].deqID = Some(tid) → ( listp(rl, vs, ps[r, ps[r].deqID:= Some(tid)], owns) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, tid, owns, r, vs] → [ps, (rl1 + first ' + rl2) + qrl, othertid, owns, first, vs], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (rl1 + first ' + rl2) + qrl, othertid, owns, first, vs

Proof step 48 from proof step-D28-D29 (previous step) (back to tree)

⊦ r ∈ rl ∧ r ∈ ps ∧ ps[r].deqID = None ∧ vs[r].deqID = Some(tid) → (listp(rl, vs, ps[r, ps[r].deqID:= Some(tid)], owns) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 49 from proof step-D28-D29 (previous step) (back to tree)

vs[first].deqID = Some(othertid), dom vrvHp = dom prvHp, first = ps[first].next, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[first].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].deqID ≠ None, addr ≠ null, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + first ' + rl2) + qrl, vs, ps[first, ps[first].deqID:= Some(othertid)], owns), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ first ∈ (rl1 + first ' + rl2) + qrl ∧ first ∈ ps ∧ ps[first].deqID = None ∧ vs[first].deqID = Some(othertid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 50 from proof step-D28-D29 (previous step) (back to tree)

vs[first].deqID = Some(othertid), dom vrvHp = dom prvHp, first = ps[first].next, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[first].val), ps[first].deqID ≠ None, addr ≠ null, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + first ' + rl2) + qrl, vs, ps[first, ps[first].deqID:= Some(othertid)], owns), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

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) ⊦ 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 + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 51 from proof step-D28-D29 (previous step) (back to tree)

vs[first].deqID = Some(othertid), dom vrvHp = dom prvHp, first = ps[first].next, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(addr) = Claimed(othertid, vs[first].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].deqID ≠ None, addr ≠ null, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ listp((rl1 + first ' + rl2) + qrl, vs, ps[first, ps[first].deqID:= Some(othertid)], owns), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 52 from proof step-D28-D29 (previous step) (back to tree)

vs[first].deqID = Some(othertid), dom vrvHp = dom prvHp, first = ps[first].next, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[first].val), ps[first].deqID ≠ None, addr ≠ null, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ listp(rl1 + first ' + qrl, vs, ps[first, ps[first].deqID:= Some(othertid)], owns), ¬ first ∈ qrl, ¬ first ∈ rl1, 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), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, phead0, qrl0]

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ 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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ some?(Some(tid)); (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) 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] ⊦ None ≠ Some(tid); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead0, y

Proof step 53 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[first].next = ps[first].next ∧ listp((rl1 + first ' + rl2) + qrl, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ some?(ps[first].deqID) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ unmarkedp(qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 54 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ listp((rl1 + first ' + rl2) + qrl, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ unmarkedp(qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)])

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] = ps

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] = ps

Proof step 55 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp((rl1 + first ' + rl2) + qrl, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ unmarkedp(qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-settid, seq:⊦ r ∈ rl ∧ r ∈ ps ∧ ps[r].deqID = None ∧ vs[r].deqID = Some(tid) → ( listp(rl, vs, ps[r, ps[r].deqID:= Some(tid)], owns) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, tid, owns, r, vs] → [ps, (rl1 + first ' + rl2) + qrl, othertid, owns, ps[first].next, vs], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (rl1 + first ' + rl2) + qrl, othertid, owns, ps[first].next, vs

Proof step 56 from proof step-D28-D29 (previous step) (back to tree)

⊦ r ∈ rl ∧ r ∈ ps ∧ ps[r].deqID = None ∧ vs[r].deqID = Some(tid) → (listp(rl, vs, ps[r, ps[r].deqID:= Some(tid)], owns) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 57 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ listp((rl1 + first ' + rl2) + qrl, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ markedp(rl1, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ markedp(rl2, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ unmarkedp(qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]), ps[first].next ∈ (rl1 + first ' + rl2) + qrl ∧ ps[first].next ∈ ps ∧ ps[ps[first].next].deqID = None ∧ vs[ps[first].next].deqID = Some(othertid)

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 14, left 23, left 24, left 26, right 1

Additional information

Proof step 58 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[first].next ∈ (rl1 + first ' + rl2) + qrl ∧ ps[first].next ∈ ps ∧ ps[ps[first].next].deqID = None ∧ vs[ps[first].next].deqID = Some(othertid)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 59 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ ps[first].next ∈ (rl1 + first ' + rl2) + qrl, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

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) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 60 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ ps[first].next ∈ (rl1 + first ' + rl2) + qrl, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 61 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ 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), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)

Proof step 62 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ ps[first].next ∈ ps, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 63 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ ps[first].next ∈ ps, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)

Proof step 64 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ∅[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ ps[first].next ∈ ps, ¬ first ∈ qrl, ¬ first ∈ rl1, 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), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + x).tail = x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = 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] ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)

Proof step 65 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = first0 + rl, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ ps[first].next ∈ ps, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) 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) ⊦ 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) ⊦ 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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 66 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, ps[vs[first].next, ∅[vs[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(∅[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ ps, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

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]

Proof step 67 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rl = [], rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, ps[vs[first].next, ∅[vs[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(∅[vs[first].next].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ ps, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, 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 = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 68 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, ps[vs[first].next, ∅[vs[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(∅[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ ps, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first, vs[first].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ first = vhead ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

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) ⊦ 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] ⊦ 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)

Proof step 69 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 70 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 71 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl1, 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), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)

Proof step 72 from proof step-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = first0 + rl, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ ps[first].next, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) 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) ⊦ 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) ⊦ 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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 73 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, ps[vs[first].next, ps[vs[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: Node, name:elim, seq:⊦ (val = nd.val ∧ opttid = nd.deqID) ∧ nxt = nd.next ↔ nd = mk(val, opttid, nxt), subst:[nd, val, opttid, nxt] → [ps[vs[first].next], invENQvalue, opttid, nxt]

Additional information

Used simplifier rules: ⊦ (val = nd.val ∧ opttid = nd.deqID) ∧ nxt = nd.next ↔ nd = mk(val, opttid, nxt); (elim) Used terms: ps[vs[first].next], val, opttid, nxt

Proof step 74 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, ps[vs[first].next, ps[vs[first].next].deqID:= Some(othertid)] ≠ ps, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(opttid), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, 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 = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mk(val, opttid, nxt).deqID:= opttid0 = mk(val, opttid0, nxt); (s)

Proof step 75 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(opttid), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, 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 = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:eq-shift-put, seq: ⊦ a ∈ st → (st[a, d] = st0 ↔ st = st0[a, st[a]] ∧ a ∈ st0 ∧ st0[a] = d), subst:[st, a, d, st0] → [ps, vs[first].next, mk(invENQvalue, Some(othertid), nxt), ps], <all paths>

Additional information

Used terms: ps, vs[first].next, mk(invENQvalue, Some(othertid), nxt), ps

Proof step 76 from proof step-D28-D29 (previous step) (back to tree)

⊦ a ∈ st → (st[a, d] = st0 ↔ st = st0[a, st[a]] ∧ a ∈ st0 ∧ st0[a] = d)

A spec-lemma

Proof step 77 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ ps, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)

Proof step 78 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, ∅[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(opttid), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ ps, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, 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 = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 79 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ∅[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ ps, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)

Proof step 80 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ∅[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (vs[first].next ' + rl).last ∈ rl1 + first ' + vs[first].next ' + rl from lst, ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ ps, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (vs[first].next ' + rl).last = vhead ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last, lst = vs[first].next ∨ lst ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ 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] ⊦ a '.last = a; (s) ⊦ markedp([], 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)

Proof step 81 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ∅[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl = first0 + qrl0, rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ ps, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 82 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first0].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, ∅[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, vs[first].next ≠ first0, ps[vs[first].next, mk(invENQvalue, Some(othertid), nxt)] ≠ ps, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, first ≠ first0, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + vs[first].next ' + rl + first0 ' + qrl0, vs, ps, owns), listp(vs[first].next ' + rl + first0 ' + qrl0, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl + first0 ' + qrl0, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(opttid), unmarkedp(qrl0, ps), vtail ∈ rl1 + first ' + vs[first].next ' + rl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + rl) + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first0 ∈ rl1, ¬ first0 ∈ rl, ¬ first0 ∈ qrl0, ¬ vs[first].next ∈ ps, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ first ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl, vtail = (first0 ' + qrl0).last ∨ vtail = (vs[first].next ' + rl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst = first0 ∨ lst ∈ qrl0, (vs[first].next ' + rl).last = vhead ∧ unmarkedp(qrl0, vs) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

Additional information

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] ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s)

Proof step 83 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, addr ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, opttid ≠ None, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vs[first].next ∈ ps, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ps ≠ ps[vs[first].next, ps[vs[first].next]] ∨ ¬ vs[first].next ∈ ps ∨ ps[vs[first].next] ≠ mk(invENQvalue, Some(othertid), nxt) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ st[a] = d ∧ a ∈ st → st[a, d] = st; (s)

Proof step 84 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, opttid ≠ None, opttid ≠ Some(othertid), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vs[first].next ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

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) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (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) ⊦ ¬ weak?(Some(tid)); (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ some?(opttid) → opttid ≠ None; (as)

Proof step 85 from proof step-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rl = [], rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), vs[first].next ≠ null, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, opttid ≠ None, opttid ≠ Some(othertid), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(opttid), unmarkedp(qrl, ps), vs[first].next ∈ ps, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, 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 = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 86 from proof step-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, ps[vs[first].next] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, addr ≠ null, first ≠ null, first ≠ lst, first ≠ vs[first].next, opttid ≠ None, opttid ≠ Some(othertid), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vhead, vs), rvownerok(vretRefs, vrvHp, rvowns), some?(opttid), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, vs[first].next ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next, vs[first].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ first = vhead ∧ phead ≠ vs[vhead].next ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + x).tail = x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = 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) ⊦ ¬ weak?(Some(tid)); (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof Tree for step-D28-D29 (View conclusion)

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.

the proof tree