[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-D26-D27 (conclusion) (back to tree)

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

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

Proof step 3 from proof step-D26-D27 (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.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), 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.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.ps, ls.first ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, gs.vs[ls.nxt].val), 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), ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, 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 ⊦ gs.vretRefs(ls.othertid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.othertid) ≠ null

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-D26-D27 (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.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, 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 ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ¬ 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), vhead = ls.first → rvowns(vretRefs(ls.othertid)) = Claimed(ls.othertid, vs[ls.nxt].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) ⊦ vretRefs(ls.othertid) ∈ vrvHp ∧ vretRefs(ls.othertid) ≠ 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-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-D26-D27 (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), vretRefs(ls.tid) = ls.rvref, 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.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(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = ls.first → rvowns(vretRefs(ls.othertid)) = Claimed(ls.othertid, vs[ls.nxt].val), 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 ⊦ vretRefs(ls.othertid) ∈ vrvHp ∧ vretRefs(ls.othertid) ≠ null

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-D26-D27 (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(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ 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 ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, rvref ∈ vrvHp, ¬ 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), vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[nxt].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) ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ 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] 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-D26-D27 (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), ps[first].next ≠ 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), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), 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 ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ null

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-D26-D27 (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-D26-D27 (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), ps[first].next ≠ 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 ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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), vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), 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) ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ 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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + 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-D26-D27 (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), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), 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 ' + 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ null

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:nonullRetRefs-def, seq:⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) ↔ (∀ r. r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null), subst:[rl, vs, vretRefs, pretRefs] → [(rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs], <all paths>

Additional information

Used terms: (rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs

Proof step 11 from proof step-D26-D27 (previous step) (back to tree)

⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) ↔ (∀ r. r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null)

A spec-lemma

Proof step 12 from proof step-D26-D27 (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), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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), vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ (rl1 + first ' + rl2) + qrl ∧ r ≠ ((rl1 + first ' + rl2) + qrl).head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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) ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ 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] ⊦ (x + a ' + y).head = (x + a ').head; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

Proof step 13 from proof step-D26-D27 (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), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. (r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl) ∧ r ≠ (rl1 + first ').head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, (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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ null

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 41 terms: ps[first].next abort: F discard: F computed: F

Additional information

Used terms: ps[first].next

Proof step 14 from proof step-D26-D27 (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), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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), vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), (ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl) ∧ ps[first].next ≠ (rl1 + first ').head ∧ vs[ps[first].next].deqID ≠ None → vretRefs(vs[ps[first].next].deqID.tid) ≠ null ∧ pretRefs(vs[ps[first].next].deqID.tid) ≠ null, ∀ r. (r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl) ∧ r ≠ (rl1 + first ').head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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) ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ 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)

Proof step 15 from proof step-D26-D27 (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), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ 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), vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), (ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl) ∧ ps[first].next ≠ (rl1 + first ').head → vretRefs(othertid) ≠ null ∧ pretRefs(othertid) ≠ null, ∀ r. (r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl) ∧ r ≠ (rl1 + first ').head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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) ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ null

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] → [rl1 + first ', vtail0, qrl0]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: rl1 + first ', vtail0, y

Proof step 16 from proof step-D26-D27 (previous step) (back to tree)

rl1 + first ' = vtail0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + first ' ≠ [], ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, (ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl) ∧ ps[first].next ≠ vtail0 → vretRefs(othertid) ≠ null ∧ pretRefs(othertid) ≠ null, vhead = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. (r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl) ∧ r ≠ vtail0 ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, (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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ vretRefs(othertid) ∈ vrvHp ∧ vretRefs(othertid) ≠ 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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 17 from proof step-D26-D27 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:allocrv-def, seq:⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null), subst:[vretRefs, vrvHp] → [vretRefs, vrvHp], <all paths>

Additional information

Used terms: vretRefs, vrvHp

Proof step 18 from proof step-D26-D27 (previous step) (back to tree)

⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null)

A spec-lemma

Proof step 19 from proof step-D26-D27 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof step-D26-D27 (previous step) (back to tree)

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 43 terms: othertid abort: F discard: F computed: T

Additional information

Used terms: othertid

Proof step 21 from proof step-D26-D27 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 41

Additional information

Proof step 22 from proof step-D26-D27 (previous step) (back to tree)

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

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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[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]

Proof step 23 from proof step-D26-D27 (previous step) (back to tree)

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

Proof step 24 from proof step-D26-D27 (previous step) (back to tree)

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

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, qrl1]

Additional information

Used simplifier rules: ⊦ 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) ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[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] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead0, y

Proof Tree for step-D26-D27 (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