[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 stable-D20 (conclusion) (back to tree)

⊦ ( ( ( 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.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ ls.optval = Val(gs0.vs[ls.nxt].val) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ;gs0.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noowns(ls.tid, gs0.owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof stable-D20 (previous step) (back to tree)

ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.vretRefs(ls.tid) = ls.rvref, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, gs0.orl ≠ [], gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ 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.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success, gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, 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, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ ( ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ ls.optval = Val(gs0.vs[ls.nxt].val) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ;gs0.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noowns(ls.tid, gs0.owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) ⊦ Val(val) = Val(val0) ↔ val = val0; (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 ⊦ noowns(tid, owns) ∧ ownsRely(tid, owns, owns0) → noowns(tid, owns0); (ss) ⊦ dom vrvHp ⊆ dom vrvHp0 ∧ rvref ∈ vrvHp → rvref ∈ vrvHp0; (ss) ⊦ 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)

Proof step 3 from proof stable-D20 (previous step) (back to tree)

gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.orl + rl0 = gs0.orl, ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, ls.rvref = gs0.vretRefs(ls.tid), ls.rvref = gs0.pretRefs(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], gs0.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.ps, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs0.orl + gs0.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.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success, gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(ls.rvref) = Claimed(ls.tid, gs.vs[ls.nxt].val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(ls.rvref) = Pending(ls.tid) ), 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, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.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), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ ls.nxt = gs0.ps[ls.first].next ∧ gs.vs[ls.nxt].val = gs0.vs[ls.nxt].val ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs0.rvowns(ls.rvref) = Claimed(ls.tid, gs.vs[ls.nxt].val) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ;gs0.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ gs0.rvowns(ls.rvref) = Pending(ls.tid) ) ∧ ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.lst ∈ gs0.orl from ls.first ∨ ls.lst ∈ gs0.qrl) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.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 stable-D20 (previous step) (back to tree)

orl + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, ls.nxt ≠ null, gs0.orl ≠ [], ls.rvref ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(orl, vs), markedp(orl, ps), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noidRely(ls.tid, orl + qrl, vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first ∧ ls.success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ls.success ⊃ vs[ls.nxt].deqID = Some(ls.tid) ∧ rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (ps[ls.nxt].deqID = None → vhead = ls.first) ∧ noid(ls.tid, orl + qrl, ls.nxt, vs) ;vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, orl + qrl, ls.first, vs) ∧ rvowns(ls.rvref) = Pending(ls.tid) ), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), 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, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ls.nxt = gs0.ps[ls.first].next ∧ vs[ls.nxt].val = gs0.vs[ls.nxt].val ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs0.rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ;gs0.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ gs0.rvowns(ls.rvref) = Pending(ls.tid) ) ∧ ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.lst ∈ gs0.orl from ls.first ∨ ls.lst ∈ gs0.qrl) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) 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 stable-D20 (previous step) (back to tree)

orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + gs0.qrl, gs0.vs), nonullRetRefs((orl + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, ls.first ∈ gs0.ps, phead ∈ gs0.ps, ls.first ∈ gs0.vs, phead ∈ gs0.vs, ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(rl0), ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first ∧ ls.success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ls.success ⊃ vs[ls.nxt].deqID = Some(ls.tid) ∧ rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (ps[ls.nxt].deqID = None → vhead = ls.first) ∧ noid(ls.tid, orl + qrl, ls.nxt, vs) ;vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, orl + qrl, ls.first, vs) ∧ rvowns(ls.rvref) = Pending(ls.tid) ), (orl + rl0).last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = gs0.vhead ∧ gs0.phead ≠ (orl + rl0).last ∧ unmarkedp(gs0.qrl, gs0.vs), 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, gs0.vtail = ((orl + rl0) + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = ((orl + rl0) + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.qrl, gs0.phead ∈ orl ∨ gs0.phead ∈ rl0 ⊦ ls.nxt = gs0.ps[ls.first].next ∧ vs[ls.nxt].val = gs0.vs[ls.nxt].val ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs0.rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, (orl + rl0) + gs0.qrl, ls.nxt, gs0.vs) ;gs0.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, (orl + rl0) + gs0.qrl, ls.first, gs0.vs) ∧ gs0.rvowns(ls.rvref) = Pending(ls.tid) ) ∧ (gs0.vhead ∈ orl from ls.first ∨ gs0.vhead ∈ rl0) ∧ gs0.vtail ∈ (orl + rl0) + gs0.qrl from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ gs0.qrl) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.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] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0]

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: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 6 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + rl0 = orl0, ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = vretRefs0(ls.tid), ls.rvref = pretRefs0(ls.tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(ls.tid) = ls.rvref, vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, phead ∈ vs0, ls.first ∈ vs0, phead ∈ ps0, ls.first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first ∧ ls.success, vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (ls.success ⊃ vs[ls.nxt].deqID = Some(ls.tid) ∧ rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (ps[ls.nxt].deqID = None → vhead = ls.first) ∧ noid(ls.tid, orl + qrl, ls.nxt, vs) ;vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, orl + qrl, ls.first, vs) ∧ rvowns(ls.rvref) = Pending(ls.tid) ), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ ls.nxt = ps0[ls.first].next ∧ vs[ls.nxt].val = vs0[ls.nxt].val ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(ls.tid) → vhead0 = ls.first ∧ ls.success) ∧ (ls.success ⊃ vs0[ls.nxt].deqID = Some(ls.tid) ∧ rvowns0(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (ps0[ls.nxt].deqID = None → vhead0 = ls.first) ∧ noid(ls.tid, (orl + rl0) + qrl0, ls.nxt, vs0) ;vs0[ls.nxt].deqID ≠ None ∧ noid(ls.tid, (orl + rl0) + qrl0, ls.first, vs0) ∧ rvowns0(ls.rvref) = Pending(ls.tid) ) ∧ (vhead0 ∈ orl from ls.first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ (vhead0 ≠ ls.first → nextnottid(ls.tid, vhead0, vs0))

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 7 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = pretRefs0(ls.tid), ls.rvref = vretRefs0(ls.tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ vs0, phead ∈ vs0, ls.first ∈ ps0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first ∧ ls.success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ls.success ⊃ vs[ls.nxt].deqID = Some(ls.tid) ∧ rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (ps[ls.nxt].deqID = None → vhead = ls.first) ∧ noid(ls.tid, orl + qrl, ls.nxt, vs) ;vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, orl + qrl, ls.first, vs) ∧ rvowns(ls.rvref) = Pending(ls.tid) ), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), 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, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ ls.nxt = ps0[ls.first].next ∧ vs[ls.nxt].val = vs0[ls.nxt].val ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(ls.tid) → vhead0 = ls.first ∧ ls.success) ∧ (ls.success ⊃ vs0[ls.nxt].deqID = Some(ls.tid) ∧ rvowns0(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val) ∧ (ps0[ls.nxt].deqID = None → vhead0 = ls.first) ∧ noid(ls.tid, (orl + rl0) + qrl0, ls.nxt, vs0) ;vs0[ls.nxt].deqID ≠ None ∧ noid(ls.tid, (orl + rl0) + qrl0, ls.first, vs0) ∧ rvowns0(ls.rvref) = Pending(ls.tid) ) ∧ (vhead0 ∈ orl from ls.first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ (vhead0 ≠ ls.first → nextnottid(ls.tid, vhead0, vs0))

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 8 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, 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, rvref = vretRefs0(tid), rvref = pretRefs0(tid), vretRefs(tid) = rvref, orl + rl0 ≠ [], first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, first ∈ ps0, phead ∈ vs0, first ∈ vs0, phead ∈ vs, first ∈ vs, phead ∈ ps, first ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, rvref ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[nxt].deqID = Some(tid) ∧ rvowns(rvref) = Claimed(tid, vs[nxt].val) ∧ (ps[nxt].deqID = None → vhead = first) ∧ noid(tid, orl + qrl, nxt, vs) ;vs[nxt].deqID ≠ None ∧ noid(tid, orl + qrl, first, vs) ∧ rvowns(rvref) = Pending(tid) ), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ nxt = ps0[first].next ∧ vs[nxt].val = vs0[nxt].val ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ (success ⊃ vs0[nxt].deqID = Some(tid) ∧ rvowns0(rvref) = Claimed(tid, vs[nxt].val) ∧ (ps0[nxt].deqID = None → vhead0 = first) ∧ noid(tid, (orl + rl0) + qrl0, nxt, vs0) ;vs0[nxt].deqID ≠ None ∧ noid(tid, (orl + rl0) + qrl0, first, vs0) ∧ rvowns0(rvref) = Pending(tid) ) ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0))

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 9 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, orl + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, orl + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), 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, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ ps[first].next = ps0[first].next ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (orl + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (orl + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0))

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 10 from proof stable-D20 (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 11 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, orl + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, orl + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ ps[first].next = ps0[first].next ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (orl + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (orl + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0))

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 ≠ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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 ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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 12 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ ps[first].next = ps0[first].next ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst ∧ (lst ∈ rl2 ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0))

User applied rule case distinction

And obtained the following new goals

Rule argument

fmapos: right 1 splitted: 6, 7

Additional information

Proof step 13 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 93

Additional information

Proof step 14 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail0 = (first ' + rl2 + rl0 + qrl0).last, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (first ' + rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ (first ' + rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ x + [] = x; (s) list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) Used terms: first ', rl2 + rl0 + qrl0

Proof step 16 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 17 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, (rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ (rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0 + qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl2, rl0 + qrl0

Proof step 18 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 19 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl0, qrl0], <all paths>

Additional information

Used terms: rl0, qrl0

Proof step 20 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 21 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl0 = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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

Proof step 22 from proof stable-D20 (previous step) (back to tree)

dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl + rl ≠ [], qrl + rl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(rl, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, (qrl + rl).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ (qrl + rl).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (qrl + rl).last = vhead0 ∨ (first ' + rl2 + (qrl + rl).butlast).last = vhead0 ∧ phead0 ≠ (qrl + rl).last, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [qrl, rl], <all paths>

Additional information

Used terms: qrl, rl

Proof step 23 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 24 from proof stable-D20 (previous step) (back to tree)

dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl + rl ≠ [], qrl + rl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl, ps0), markedp(qrl, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl, vs0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (qrl + rl).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ (qrl + rl).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), (qrl + rl).last = vhead0 ∨ (first ' + rl2 + (qrl + rl).butlast).last = vhead0 ∧ phead0 ≠ (qrl + rl).last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 25 from proof stable-D20 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(qrl, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, (first ' + rl2 + qrl.butlast).last ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, qrl.last ∈ rl1 + first ' + rl2 + qrl from (first ' + rl2 + qrl.butlast).last, vhead0 ∈ rl1 + first ' + rl2 + qrl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(qrl), ¬ qrl.last ∈ rl1 + first ' + rl2 + qrl from lst, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), qrl.last = vhead0 ∨ (first ' + rl2 + qrl.butlast).last = vhead0 ∧ phead0 ≠ qrl.last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, phead1, rl]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 26 from proof stable-D20 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + rl, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(qrl, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl from vhead, qrl.last ∈ rl1 + first ' + rl2 + qrl from (first ' + rl2 + qrl.butlast).last, pretRefs0(tid) ∈ vrvHp, (first ' + rl2 + qrl.butlast).last ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(qrl), ¬ qrl.last ∈ rl1 + first ' + rl2 + qrl from lst, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[phead1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, qrl.last = vhead0 ∨ (first ' + rl2 + qrl.butlast).last = vhead0 ∧ phead0 ≠ qrl.last, (first ' + rl2).last = vhead ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ⊦

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 ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 27 from proof stable-D20 (previous step) (back to tree)

ps[phead1].deqID = None, vs[(phead1 ' + rl).last].deqID = None, vs[(phead1 ' + rl).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, lst ≠ phead1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, owns), listp(first ' + rl2 + phead1 ' + rl, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl, vs, rl1 + first ' + rl2 + phead1 ' + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps), vhead0 ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead, (phead1 ' + rl).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from (first ' + rl2 + (phead1 ' + rl).butlast).last, pretRefs0(tid) ∈ vrvHp, (first ' + rl2 + (phead1 ' + rl).butlast).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl), ¬ dups(rl1), ¬ dups((rl1 + rl2) + rl), ¬ first ∈ rl, ¬ (phead1 ' + rl).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[phead1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead1 ∨ phead0 ∈ rl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (phead1 ' + rl).last = vhead0 ∨ (first ' + rl2 + (phead1 ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (phead1 ' + rl).last, (first ' + rl2).last = vhead ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl ∨ lst ∈ rl2 ⊦

Heuristic use patterns 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] → [first ' + rl2 + (phead1 ' + rl).butlast, vhead1, rl0]

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.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: first ' + rl2 + (phead1 ' + rl).butlast, vhead1, y

Proof step 28 from proof stable-D20 (previous step) (back to tree)

first ' + rl2 + (phead1 ' + rl).butlast = rl0 + vhead1 ', vs[(phead1 ' + rl).last].deqID = None, ps[phead1].deqID = None, vs[(phead1 ' + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), first ' + rl2 + (phead1 ' + rl).butlast ≠ [], ps[first].next ≠ null, first ≠ phead1, first ≠ lst, lst ≠ phead1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs0, ps0, owns0), listp(first ' + rl2 + phead1 ' + rl, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, owns), markedp(rl, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl, vs, rl1 + first ' + rl2 + phead1 ' + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(rl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vhead1 ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, pretRefs0(tid) ∈ vrvHp, (phead1 ' + rl).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead1, vhead0 ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl), ¬ dups(rl1), ¬ dups((rl1 + rl2) + rl), ¬ first ∈ rl, ¬ (phead1 ' + rl).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[phead1].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), lst ∈ rl ∨ lst ∈ rl2, (first ' + rl2).last = vhead ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl, vs), (phead1 ' + rl).last = vhead0 ∨ vhead1 = vhead0 ∧ phead0 ≠ (phead1 ' + rl).last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead1 ∨ phead0 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ' + x ≠ []; (s)

Proof step 29 from proof stable-D20 (previous step) (back to tree)

first ' + rl2 + (phead1 ' + rl).butlast = rl0 + vhead1 ', vs[(phead1 ' + rl).last].deqID = None, ps[phead1].deqID = None, vs[(phead1 ' + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, lst ≠ phead1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs0, ps0, owns0), listp(first ' + rl2 + phead1 ' + rl, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, owns), markedp(rl, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl, vs, rl1 + first ' + rl2 + phead1 ' + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(rl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vhead1 ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, pretRefs0(tid) ∈ vrvHp, (phead1 ' + rl).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead1, vhead0 ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl, ¬ phead1 ∈ rl1, ¬ (phead1 ' + rl).last ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, ¬ first ∈ rl, vs[phead1].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), lst ∈ rl ∨ lst ∈ rl2, (first ' + rl2).last = vhead ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl, vs), (phead1 ' + rl).last = vhead0 ∨ vhead1 = vhead0 ∧ phead0 ≠ (phead1 ' + rl).last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead1 ∨ phead0 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ rl, first ∈ rl0 ∨ first = vhead1, vhead1 = first ∨ vhead1 ∈ rl2 ∨ vhead1 ∈ (phead1 ' + rl).butlast ⊦

Heuristic use patterns 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] → [phead1 ' + rl, lst0, rl3]

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.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: phead1 ' + rl, lst0, y

Proof step 30 from proof stable-D20 (previous step) (back to tree)

first ' + rl2 + rl3 = rl0 + vhead1 ', phead1 ' + rl = rl3 + lst0 ', ps[phead1].deqID = None, vs[lst0].deqID = None, vs[lst0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), phead1 ' + rl ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ phead1, lst ≠ phead1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs, ps, owns), listp(first ' + rl2 + phead1 ' + rl, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl, vs, rl1 + first ' + rl2 + phead1 ' + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps), vhead0 ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead, lst0 ∈ rl1 + first ' + rl2 + phead1 ' + rl from vhead1, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl2) + rl), ¬ dups(rl1), ¬ dups(rl2 + rl), ¬ dups(rl1 + rl2), ¬ dups(rl), ¬ dups(rl2), ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl, ¬ phead1 ∈ rl1, ¬ lst0 ∈ rl1 + first ' + rl2 + phead1 ' + rl from lst, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[phead1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead1 = first ∨ vhead1 ∈ rl2 ∨ vhead1 ∈ rl3, first ∈ rl0 ∨ first = vhead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead1 ∨ phead0 ∈ rl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst0 = vhead0 ∨ vhead1 = vhead0 ∧ phead0 ≠ lst0, (first ' + rl2).last = vhead ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl ∨ lst ∈ rl2 ⊦

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

Proof step 31 from proof stable-D20 (previous step) (back to tree)

first ' + rl2 + rl3 = rl0 + vhead1 ', phead1 ' + rl = rl3 + lst0 ', ps[phead1].deqID = None, vs[lst0].deqID = None, vs[lst0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, lst ≠ phead1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + rl3 + lst0 ', vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + rl3 + lst0 ', vs, ps, owns), listp(first ' + rl2 + rl3 + lst0 ', vs, ps, owns), listp(rl1 + first ' + rl2 + rl3 + lst0 ', vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + rl3 + lst0 ', vs, rl1 + first ' + rl2 + rl3 + lst0 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + rl3 + lst0 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + rl3 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl, ps), vhead0 ∈ rl1 + first ' + rl2 + rl3 + lst0 ' from vhead, lst0 ∈ rl1 + first ' + rl2 + rl3 + lst0 ' from vhead1, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + rl3 + lst0 ' from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl), ¬ dups(rl1), ¬ dups((rl1 + rl2) + rl), ¬ first ∈ rl, ¬ lst0 ∈ rl1 + first ' + rl2 + rl3 + lst0 ' from lst, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[phead1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + rl3 + lst0 ', ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + rl3 + lst0 ', first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), first ∈ rl0 ∨ first = vhead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead1 ∨ phead0 ∈ rl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst0 = vhead0 ∨ vhead1 = vhead0 ∧ phead0 ≠ lst0, (first ' + rl2).last = vhead ∧ unmarkedp(rl, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl, vs), lst ∈ rl ∨ lst ∈ rl2, vhead1 = first ∨ vhead1 ∈ rl2 ∨ vhead1 ∈ rl3, phead1 ∈ rl3 ∨ phead1 = lst0, lst0 = phead1 ∨ lst0 ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + rl2 + rl3 + lst0 ', lst], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) inapp-13: ⊦ a ' + x = y + b ' ∧ c ∈ x ∧ c ≠ b → c ∈ y; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) 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-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) Used terms: rl1, first ' + rl2 + rl3 + lst0 ', lst

Proof step 32 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 33 from proof stable-D20 (previous step) (back to tree)

dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl + rl ≠ [], qrl + rl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl, ps0), markedp(qrl, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl, vs0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, rl.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ rl.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), rl.last = vhead0 ∨ (first ' + rl2 + (qrl + rl).butlast).last = vhead0 ∧ phead0 ≠ rl.last ⊦

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] ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s)

Proof step 34 from proof stable-D20 (previous step) (back to tree)

dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl + rl ≠ [], qrl + rl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(rl, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, rl.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ rl.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, rl.last = vhead0 ∨ (first ' + rl2 + qrl + rl.butlast).last = vhead0 ∧ phead0 ≠ rl.last ⊦

Heuristic use patterns 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] → [rl, phead1, qrl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead1, y

Proof step 35 from proof stable-D20 (previous step) (back to tree)

dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = qrl0 + phead1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl + rl ≠ [], qrl + rl ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl, ps0), markedp(qrl, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl, vs0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 = vhead0 ∨ (first ' + rl2 + qrl + qrl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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) ⊦

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 36 from proof stable-D20 (previous step) (back to tree)

dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + qrl0 + phead1 ', vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(qrl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + qrl0 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + qrl0 + phead1 ' from vhead, phead1 ∈ rl1 + first ' + rl2 + qrl + qrl0 + phead1 ' from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2), ¬ dups(qrl + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + qrl), ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + qrl0 + phead1 ' from lst, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + qrl + qrl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl ∨ phead0 ∈ qrl0 ∨ phead0 = phead1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + rl2 + qrl + qrl0 + phead1 ', lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) Used terms: rl1, first ' + rl2 + qrl + qrl0 + phead1 ', lst

Proof step 37 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 38 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, qrl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ qrl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 39 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, qrl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ qrl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, vtail0, rl3]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 40 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl0 = vtail0 + rl3, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, qrl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ qrl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ a ' + x ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 41 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + rl3).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (vtail0 ' + rl3).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', rl3], <all paths>

Additional information

Used terms: vtail0 ', rl3

Proof step 42 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 43 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl3 = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, (vtail0 ' + rl3).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (vtail0 ' + rl3).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

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) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)

Proof step 44 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail0 ∈ qrl ∨ vtail0 ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s) Used terms: rl1, first ' + rl2 + qrl + rl, lst

Proof step 45 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 46 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, rl3 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, rl3.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ rl3.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

Heuristic use patterns 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] → [rl3, phead1, rl4]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl3, phead1, y

Proof step 47 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl3 = rl4 + phead1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, rl3 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ⊦

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) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ x + a ' ≠ []; (s)

Proof step 48 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl4 + phead1 ', ps0[phead1].deqID = None, ps0[vtail0].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl4, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl4), ¬ dups(rl1), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl4), ¬ dups(rl2 + qrl), ¬ first ∈ rl4, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl0, ¬ phead1 ∈ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl4, vs0) ∧ vs0[phead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl4, vs0) ∧ vs0[phead1].deqID = None, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead1 ∈ qrl ∨ phead1 ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) Used terms: rl1, first ' + rl2 + qrl + rl, lst

Proof step 49 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 50 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 51 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (first ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ (first ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, vtail0, rl3]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 52 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl0 = vtail0 + rl3, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, (first ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ (first ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ a ' + x ≠ []; (s)

Proof step 53 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, vs0[(vtail0 ' + rl3).last].deqID = None, ps0[vtail0].deqID = None, vs0[(vtail0 ' + rl3).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (first ' + rl2 + rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (first ' + rl2 + rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first ', rl2 + rl0 + (vtail0 ' + rl3).butlast], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) one: ⊦ x + y = a ' ∧ b ∈ x → a = b ∧ x = a ' ∧ y = []; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x + [] = x; (s) ⊦ a ' = b ' ↔ a = b; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: first ', rl2 + rl0 + (vtail0 ' + rl3).butlast

Proof step 54 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 55 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, vs0[(vtail0 ' + rl3).last].deqID = None, vs0[(vtail0 ' + rl3).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 + (vtail0 ' + rl3).butlast ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, (rl2 + rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (rl2 + rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0 + (vtail0 ' + rl3).butlast], <all paths>

Additional information

Used terms: rl2, rl0 + (vtail0 ' + rl3).butlast

Proof step 56 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 57 from proof stable-D20 (previous step) (back to tree)

rl0 + (vtail0 ' + rl3).butlast = [], qrl + rl = rl0 + vtail0 ' + rl3, vs0[(vtail0 ' + rl3).last].deqID = None, ps0[vtail0].deqID = None, vs0[(vtail0 ' + rl3).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 + (vtail0 ' + rl3).butlast ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (rl2 + rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (rl2 + rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x + [] = x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ ¬ a ∈ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ markedp([], vs); (s) ⊦ a '.last = a; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as)

Proof step 58 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, rl2.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl2), ¬ rl2.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail0, rl2.last = vhead0 ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ⊦

Heuristic use patterns 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, phead1, rl0]

Additional information

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

Proof step 59 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = rl0 + phead1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl2), ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 = vhead0 ∨ (first ' + rl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail0, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

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); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) 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; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 60 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, first ≠ vtail0, lst ≠ phead1, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl0 + phead1 ') + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + (rl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl0 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (rl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl0 + phead1 ') + qrl, vs, rl1 + first ' + (rl0 + phead1 ') + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + (rl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl0 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), phead1 ∈ rl1 + first ' + (rl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl0 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + (rl0 + phead1 ') + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl0 + qrl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl1 + rl0), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl1 + first ' + (rl0 + phead1 ') + qrl + rl from lst, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl0, ¬ first ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl0 + phead1 ') + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl0 + phead1 ') + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead = first ∨ vhead ∈ rl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = phead1, phead1 = vhead0 ∨ (first ' + rl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 + first ' + rl0 + phead1 ' from phead ∨ phead0 = vtail0, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = phead1, lst ∈ qrl ∨ lst ∈ rl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1 + first ' + rl0 + phead1 ', qrl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) one: ⊦ x + y = a ' ∧ b ∈ x → a = b ∧ x = a ' ∧ y = []; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ dups(a '); (s) ⊦ a '.last = a; (s) ⊦ a '.tail = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' ≠ []; (s) ⊦ a '.head = a; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) Used terms: rl1 + first ' + rl0 + phead1 ', qrl, lst

Proof step 61 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 62 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, vs0[(vtail0 ' + rl3).last].deqID = None, ps0[vtail0].deqID = None, vs0[(vtail0 ' + rl3).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + (vtail0 ' + rl3).butlast ≠ [], rl2 + rl0 + (vtail0 ' + rl3).butlast ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl0, (vtail0 ' + rl3).butlast], <all paths>

Additional information

Used terms: rl0, (vtail0 ' + rl3).butlast

Proof step 63 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 64 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, (vtail0 ' + rl3).butlast = [], ps0[vtail0].deqID = None, vs0[(vtail0 ' + rl3).last].deqID = None, vs0[(vtail0 ' + rl3).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + (vtail0 ' + rl3).butlast ≠ [], rl2 + rl0 + (vtail0 ' + rl3).butlast ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, (rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (rl0 + (vtail0 ' + rl3).butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

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) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s)

Proof step 65 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), rl0.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ dups(rl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ rl0.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, rl0.last = vhead0 ∨ (first ' + rl2 + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 ∈ qrl ∨ vtail0 ∈ rl ⊦

Heuristic use patterns 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] → [rl0, phead1, rl3]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, phead1, y

Proof step 66 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = rl3 + phead1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ dups(rl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail0 ∈ qrl ∨ vtail0 ∈ rl, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ⊦

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 67 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ phead1, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vtail0 ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags:

Additional information

Proof step 68 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ phead1, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from vhead, phead1 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from lst, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, rl1 + first ' + rl2 + rl3, owns0, phead1 ' + vtail0 ', vs0]

Additional information

Used terms: ps0, rl1 + first ' + rl2 + rl3, owns0, phead1 ' + vtail0 ', vs0

Proof step 69 from proof stable-D20 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 70 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ phead1, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), phead1 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from vtail, vhead0 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from lst, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp((rl1 + first ' + rl2 + rl3) + phead1 ' + vtail0 ', vs0, ps0, owns0) → (listp(phead1 ' + vtail0 ', vs0, ps0, owns0) ↔ phead1 ' + vtail0 ' ≠ []), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vtail0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ weak?(None); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) ⊦ a ' + x ≠ []; (s)

Proof step 71 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vs0[phead1].next ', ps0[vs0[phead1].next].deqID = None, vs0[vs0[phead1].next].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].val = vs0[phead1].val, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, owns0(vs0[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[phead1].next ≠ phead1, vs0[phead1].next ≠ null, first ≠ lst, first ≠ vs0[phead1].next, first ≠ phead1, phead1 ≠ null, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, phead1 ∈ vs0, phead1 ∈ ps0, vs0[phead1].next ∈ vs0, vs0[phead1].next ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ weak?(vs0[phead1].deqID), ¬ vs0[phead1].next ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl2, ¬ vs0[phead1].next ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, vs0[phead1].next ∈ qrl ∨ vs0[phead1].next ∈ rl, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: rl1, first ' + rl2 + qrl + rl, lst

Proof step 72 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 73 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vs0[phead1].next ', ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vs0[phead1].next) = None, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[phead1].next ≠ phead1, vs0[phead1].next ≠ null, first ≠ lst, first ≠ vs0[phead1].next, first ≠ phead1, phead1 ≠ null, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), vs0[phead1].next ∈ ps0, vs0[phead1].next ∈ vs0, phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ weak?(vs0[phead1].deqID), ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ phead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl2, ¬ vs0[phead1].next ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), vs0[phead1].next ∈ qrl ∨ vs0[phead1].next ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next ⊦

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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

Proof step 74 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vs0[phead1].next ', ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vs0[phead1].next) = None, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[phead1].next ≠ null, vs0[phead1].next ≠ phead1, ps[first].next ≠ null, first ≠ phead1, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ null, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vs0[phead1].next ∈ ps0, vs0[phead1].next ∈ vs0, phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl, vtail ∈ qrl from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ weak?(vs0[phead1].deqID), ¬ vs0[phead1].next ∈ rl1, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl3, ¬ vs0[phead1].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ lst ∈ rl2, ¬ phead1 ∈ qrl from lst, ¬ phead1 ∈ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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), vs0[phead1].next ∈ qrl ∨ vs0[phead1].next ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] → [qrl, vtail0, rl0]

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (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: qrl, vtail0, y

Proof step 75 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vs0[phead1].next ', ps0[vs0[phead1].next].deqID = None, vs0[vs0[phead1].next].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].val = vs0[phead1].val, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, owns0(vs0[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), qrl = vtail0 + rl0, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[phead1].next ≠ null, vs0[phead1].next ≠ phead1, ps[first].next ≠ null, first ≠ phead1, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ null, pretRefs0(tid) ≠ null, qrl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, vtail ∈ qrl from lst, lst ∈ qrl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, phead1 ∈ vs0, phead1 ∈ ps0, vs0[phead1].next ∈ vs0, vs0[phead1].next ∈ ps0, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ weak?(vs0[phead1].deqID), ¬ vs0[phead1].next ∈ rl1, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl3, ¬ vs0[phead1].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ lst ∈ rl2, ¬ phead1 ∈ qrl from lst, ¬ phead1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[vtail0].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, vs0[phead1].next ∈ qrl ∨ vs0[phead1].next ∈ rl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(rl0, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, 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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[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] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)

Proof step 76 from proof stable-D20 (previous step) (back to tree)

(vtail0 ' + rl0) + rl = (rl3 + phead1 ') + vs0[phead1].next ', ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].deqID = None, ps[vtail0].deqID = None, (rl0 + rl).last = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vs0[phead1].next) = None, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[phead1].next ≠ null, vs0[phead1].next ≠ phead1, ps[first].next ≠ null, first ≠ phead1, first ≠ vs0[phead1].next, first ≠ lst, first ≠ vtail0, phead1 ≠ null, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail0 ' + rl0, vs, ps, vs0, ps0), listp(first ' + rl2 + vtail0 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vtail0 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail0 ' + rl0, vs, rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail0 ' + rl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(vs0[phead1].deqID), unmarkedp(rl0, ps), pretRefs0(tid) ∈ vrvHp, vs0[phead1].next ∈ ps0, vs0[phead1].next ∈ vs0, phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ vtail0 ' + rl0 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0), ¬ dups(rl2), ¬ weak?(vs0[phead1].deqID), ¬ phead1 ∈ rl, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl3, ¬ vs0[phead1].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ lst ∈ rl2, ¬ phead1 ∈ vtail0 ' + rl0 from lst, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vtail0].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail0 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail0 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vs0[phead1].next ∈ rl0 ∨ vs0[phead1].next ∈ rl, vtail0 = phead1 ∨ vtail0 ∈ rl3, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst = vtail0 ∨ lst ∈ rl0, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs), vtail = (vtail0 ' + rl0).last ∨ vtail = (first ' + rl2 + (vtail0 ' + rl0).butlast).last ∧ vs[(vtail0 ' + rl0).last].deqID = None ∧ vs[(vtail0 ' + rl0).last].next = null, vtail0 ∈ rl3 ∨ vtail0 = phead1 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl3

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ markedp([], vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) one: ⊦ x + y = a ' ∧ b ∈ x → a = b ∧ x = a ' ∧ y = []; (forward) from specification list[reflist] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ dups(a '); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 77 from proof stable-D20 (previous step) (back to tree)

(vtail0 ' + rl0) + rl = (rl3 + phead1 ') + vs0[phead1].next ', ps[vtail0].deqID = None, ps0[vs0[phead1].next].deqID = None, vs0[vs0[phead1].next].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, (rl0 + rl).last = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].val = vs0[phead1].val, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, owns0(vs0[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rl3 = vtail1 + rl4, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[phead1].next ≠ null, vs0[phead1].next ≠ phead1, ps[first].next ≠ null, first ≠ phead1, first ≠ vs0[phead1].next, first ≠ lst, first ≠ vtail0, phead1 ≠ null, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail0 ' + rl0, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vtail0 ' + rl0, vs, ps, owns), listp(first ' + rl2 + vtail0 ' + rl0, vs, ps, owns), markedp(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail0 ' + rl0, vs, rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vtail0 ' + rl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps), lst ∈ ps, lst ∈ vs, vtail ∈ vtail0 ' + rl0 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl from vhead, phead1 ∈ rl1 + first ' + rl2 + (vtail0 ' + rl0) + rl from vtail, phead1 ∈ vs0, phead1 ∈ ps0, vs0[phead1].next ∈ vs0, vs0[phead1].next ∈ ps0, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0), ¬ dups(rl2), ¬ weak?(vs0[phead1].deqID), ¬ phead1 ∈ rl, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl3, ¬ vs0[phead1].next ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ lst ∈ rl2, ¬ phead1 ∈ vtail0 ' + rl0 from lst, vs[vtail0].deqID = Some(tid) → vhead = first ∧ success, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail0 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail0 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail0 ∈ rl3 ∨ vtail0 = phead1, vtail = (vtail0 ' + rl0).last ∨ vtail = (first ' + rl2 + (vtail0 ' + rl0).butlast).last ∧ vs[(vtail0 ' + rl0).last].deqID = None ∧ vs[(vtail0 ' + rl0).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs), lst = vtail0 ∨ lst ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, vtail0 = phead1 ∨ vtail0 ∈ rl3, vs0[phead1].next ∈ rl0 ∨ vs0[phead1].next ∈ 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 ∈ x → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 78 from proof stable-D20 (previous step) (back to tree)

rl0 + rl = rl4 + phead1 ' + vs0[phead1].next ', ps[vtail1].deqID = None, ps0[vs0[phead1].next].deqID = None, vs0[vs0[phead1].next].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, (rl0 + rl).last = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].val = vs0[phead1].val, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, owns0(vs0[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[phead1].next ≠ phead1, vs0[phead1].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ vs0[phead1].next, first ≠ phead1, lst ≠ vtail1, phead1 ≠ vtail1, phead1 ≠ null, pretRefs0(tid) ≠ null, vtail1 ≠ vs0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), markedp(rl4, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl4, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, vs, rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vhead, phead1 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vtail, phead1 ∈ vs0, phead1 ∈ ps0, vs0[phead1].next ∈ vs0, vs0[phead1].next ∈ ps0, pretRefs0(tid) ∈ vrvHp, lst ∈ rl0, lst ∈ ps, lst ∈ vs, vtail ∈ rl0 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ weak?(vs0[phead1].deqID), ¬ lst ∈ rl2, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl2, ¬ vs0[phead1].next ∈ rl4, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vtail1 ∈ rl0, ¬ phead1 ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl2, ¬ phead1 ∈ rl0 from lst, vs[vtail1].deqID = Some(tid) → vhead = first ∧ success, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs0[phead1].next ∈ rl0 ∨ vs0[phead1].next ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, phead1 = vhead0 ∨ (vtail1 ' + rl4).last = vhead0 ∧ phead0 ≠ phead1, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail1].deqID = None ∧ unmarkedp(rl0, vs), vtail = rl0.last ∨ vtail = (first ' + rl2 + (vtail1 ' + rl0).butlast).last ∧ vs[rl0.last].deqID = None ∧ vs[rl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl0, rl], <all paths>

Additional information

Used terms: rl0, rl

Proof step 79 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 80 from proof stable-D20 (previous step) (back to tree)

rl0 + rl = rl4 + phead1 ' + vs0[phead1].next ', ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].deqID = None, ps[vtail1].deqID = None, (rl0 + rl).last = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vs0[phead1].next) = None, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rl = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[phead1].next ≠ phead1, vs0[phead1].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ vs0[phead1].next, first ≠ phead1, lst ≠ vtail1, phead1 ≠ vtail1, phead1 ≠ null, pretRefs0(tid) ≠ null, vtail1 ≠ vs0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, vs0, ps0), listp(first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, vs, rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(vs0[phead1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl0, ps), vtail ∈ rl0 from lst, lst ∈ vs, lst ∈ ps, lst ∈ rl0, pretRefs0(tid) ∈ vrvHp, vs0[phead1].next ∈ ps0, vs0[phead1].next ∈ vs0, phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ weak?(vs0[phead1].deqID), ¬ lst ∈ rl2, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl2, ¬ vs0[phead1].next ∈ rl4, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vtail1 ∈ rl0, ¬ phead1 ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl2, ¬ phead1 ∈ rl0 from lst, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vtail1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = rl0.last ∨ vtail = (first ' + rl2 + (vtail1 ' + rl0).butlast).last ∧ vs[rl0.last].deqID = None ∧ vs[rl0.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail1].deqID = None ∧ unmarkedp(rl0, vs), phead1 = vhead0 ∨ (vtail1 ' + rl4).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, vs0[phead1].next ∈ rl0 ∨ vs0[phead1].next ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s)

Proof step 81 from proof stable-D20 (previous step) (back to tree)

vs[rl0.last].deqID = None, ps[vtail1].deqID = None, ps0[rl0.last].deqID = None, vs0[rl0.last].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, rl0.last = vs0[phead1].next, vs[rl0.last].next = null, vs0[rl0.last].next = null, ps0[phead1].next = rl0.last, ps0[rl0.last].next = null, ps0[phead1].val = vs0[phead1].val, ps0[rl0.last].val = vs0[rl0.last].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, owns0(rl0.last) = None, pretRefs(tid) = pretRefs0(tid), rl0 = rl4 + phead1 ' + rl0.last ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (vtail1 ' + rl0.butlast).last ≠ rl0.last, rl0.last ≠ phead1, rl0.last ≠ null, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ rl0.last, first ≠ phead1, lst ≠ vtail1, phead1 ≠ vtail1, phead1 ≠ null, pretRefs0(tid) ≠ null, rl0 ≠ [], vtail1 ≠ rl0.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vtail1 ' + rl0, vs0, ps0, owns0), markedp(rl4, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl4, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, vs, rl1 + first ' + rl2 + vtail1 ' + rl0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail1 ' + rl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl0, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + vtail1 ' + rl0 from vhead, phead1 ∈ rl1 + first ' + rl2 + vtail1 ' + rl0 from (vtail1 ' + rl0.butlast).last, phead1 ∈ vs0, phead1 ∈ ps0, pretRefs0(tid) ∈ vrvHp, lst ∈ rl0, lst ∈ ps, lst ∈ vs, (vtail1 ' + rl0.butlast).last ∈ rl0 from lst, rl0.last ∈ vs, rl0.last ∈ ps, lst ∈ vs0, rl0.last ∈ vs0, lst ∈ ps0, rl0.last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups((rl1 + rl2) + rl0), ¬ dups((rl1 + rl2) + rl4), ¬ weak?(vs0[phead1].deqID), ¬ lst ∈ rl2, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ rl0.last ∈ rl2, ¬ rl0.last ∈ rl4, ¬ lst ∈ rl1, ¬ rl0.last ∈ rl1, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl2, ¬ phead1 ∈ rl0 from lst, vs[vtail1].deqID = Some(tid) → vhead = first ∧ success, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1 ∨ phead0 = rl0.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, phead1 = vhead0 ∨ (vtail1 ' + rl4).last = vhead0 ∧ phead0 ≠ phead1, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail1].deqID = None ∧ unmarkedp(rl0, vs) ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 82 from proof stable-D20 (previous step) (back to tree)

rl0 + rl = rl4 + phead1 ' + vs0[phead1].next ', ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].deqID = None, ps[vtail1].deqID = None, rl.last = vs0[phead1].next, ps0[vs0[phead1].next].next = null, ps0[phead1].next = vs0[phead1].next, vs0[vs0[phead1].next].next = null, ps0[vs0[phead1].next].val = vs0[vs0[phead1].next].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vs0[phead1].next) = None, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[phead1].next ≠ phead1, vs0[phead1].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ vs0[phead1].next, first ≠ phead1, lst ≠ vtail1, phead1 ≠ vtail1, phead1 ≠ null, pretRefs0(tid) ≠ null, rl ≠ [], vtail1 ≠ vs0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, vs0, ps0), listp(first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, vs, rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(vs0[phead1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl0, ps), vtail ∈ rl0 from lst, lst ∈ vs, lst ∈ ps, lst ∈ rl0, pretRefs0(tid) ∈ vrvHp, vs0[phead1].next ∈ ps0, vs0[phead1].next ∈ vs0, phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ weak?(vs0[phead1].deqID), ¬ lst ∈ rl2, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl2, ¬ vs0[phead1].next ∈ rl4, ¬ lst ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vtail1 ∈ rl0, ¬ phead1 ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl2, ¬ phead1 ∈ rl0 from lst, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vtail1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = rl0.last ∨ vtail = (first ' + rl2 + (vtail1 ' + rl0).butlast).last ∧ vs[rl0.last].deqID = None ∧ vs[rl0.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail1].deqID = None ∧ unmarkedp(rl0, vs), phead1 = vhead0 ∨ (vtail1 ' + rl4).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1 ∨ phead0 = vs0[phead1].next, vs0[phead1].next ∈ rl0 ∨ vs0[phead1].next ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2 ⊦

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 ' + x).last = x.last; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ b ' ↔ a = b; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (forward) from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 83 from proof stable-D20 (previous step) (back to tree)

rl0 + rl = rl4 + phead1 ' + rl.last ', ps0[phead1].deqID = vs0[phead1].deqID, vs0[rl.last].deqID = None, ps0[rl.last].deqID = None, ps[vtail1].deqID = None, rl.last = vs0[phead1].next, ps0[rl.last].next = null, ps0[phead1].next = rl.last, vs0[rl.last].next = null, ps0[rl.last].val = vs0[rl.last].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(rl.last) = None, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl.last ≠ null, rl.last ≠ phead1, ps[first].next ≠ null, first ≠ phead1, first ≠ rl.last, first ≠ lst, first ≠ vtail1, lst ≠ vtail1, lst ≠ phead1, phead1 ≠ null, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, rl ≠ [], vtail1 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, vs0, ps0), listp(first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, vs, rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail1 ' + rl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(vs0[phead1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl0, ps), vtail ∈ rl0 from lst, lst ∈ vs, lst ∈ ps, lst ∈ rl0, pretRefs0(tid) ∈ vrvHp, rl.last ∈ ps0, rl.last ∈ vs0, phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vtail1 ' + rl0) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ rl4, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl4), ¬ dups(rl2), ¬ weak?(vs0[phead1].deqID), ¬ phead1 ∈ rl0 from lst, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl1, ¬ phead1 ∈ rl, ¬ vtail1 ∈ rl0, ¬ rl.last ∈ rl1, ¬ lst ∈ rl1, ¬ rl.last ∈ rl4, ¬ rl.last ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ lst ∈ 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), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vtail1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + vtail1 ' + rl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = rl0.last ∨ vtail = (first ' + rl2 + (vtail1 ' + rl0).butlast).last ∧ vs[rl0.last].deqID = None ∧ vs[rl0.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vtail1].deqID = None ∧ unmarkedp(rl0, vs), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = vtail1 ∨ phead0 ∈ rl4 ∨ phead0 = phead1 ∨ phead0 = rl.last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead1 = vhead0 ∨ rl4.last = vhead0 ∧ phead0 ≠ phead1 ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead1, y

Proof step 84 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, vs0[(vtail0 ' + rl3).last].deqID = None, vs0[(vtail0 ' + rl3).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + (vtail0 ' + rl3).butlast ≠ [], rl2 + rl0 + (vtail0 ' + rl3).butlast ≠ [], (vtail0 ' + rl3).butlast ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, (vtail0 ' + rl3).butlast.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (vtail0 ' + rl3).butlast.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ first ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

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 ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s)

Proof step 85 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, ps0[vtail0].deqID = None, vs0[rl3.last].deqID = None, vs0[rl3.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, rl3 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + rl3.butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (vtail0 ' + rl3.butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ⊦

Heuristic use patterns 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] → [rl3, phead1, rl4]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl3, phead1, y

Proof step 86 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl3, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl3 = rl4 + phead1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, rl3 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + rl3), ¬ dups((rl1 + rl2 + rl0) + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

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) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ x + a ' ≠ []; (s)

Proof step 87 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl4 + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl4, ps0), unmarkedp(qrl, ps), (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl4), ¬ dups(rl1), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl4), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl4, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl4, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 ∈ qrl ∨ phead1 ∈ rl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', rl4], <all paths>

Additional information

Used terms: vtail0 ', rl4

Proof step 88 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 89 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl4 + phead1 ', ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl4 = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl4, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl4), ¬ dups(rl1), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl4), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 ∈ qrl ∨ phead1 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl4, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl4, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 90 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 ∈ qrl ∨ phead1 ∈ rl, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1 ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags:

Additional information

Proof step 91 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + phead1 ', ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ', vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ', vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ', vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ' from vtail, vhead0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vtail0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ' from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead1 ∈ qrl ∨ phead1 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, rl1 + first ' + rl2 + rl0, owns0, vtail0 ' + phead1 ', vs0]

Additional information

Used terms: ps0, rl1 + first ' + rl2 + rl0, owns0, vtail0 ' + phead1 ', vs0

Proof step 92 from proof stable-D20 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 93 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ', vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ' from vhead, vtail0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ' from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vtail0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' + phead1 ' from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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((rl1 + first ' + rl2 + rl0) + vtail0 ' + phead1 ', vs0, ps0, owns0) → (listp(vtail0 ' + phead1 ', vs0, ps0, owns0) ↔ vtail0 ' + phead1 ' ≠ []), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 ∈ qrl ∨ phead1 ∈ rl, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ weak?(None); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ 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) ⊦ a ' + x ≠ []; (s)

Proof step 94 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + vs0[vtail0].next ', ps0[vtail0].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vs0[vtail0].next].deqID = None, vs0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].val = vs0[vtail0].val, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vtail0) = None, owns0(vs0[vtail0].next) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vtail0].next ≠ null, first ≠ vs0[vtail0].next, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[vtail0].next, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vs0, vtail0 ∈ ps0, vs0[vtail0].next ∈ vs0, vs0[vtail0].next ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs0[vtail0].deqID), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ vs0[vtail0].next ∈ rl1, ¬ vs0[vtail0].next ∈ rl0, ¬ vs0[vtail0].next ∈ rl2, ¬ vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, vs0[vtail0].next ∈ qrl ∨ vs0[vtail0].next ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1 + first ' + rl2, qrl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ y ≠ [] → (a ' + x + y).last = y.last; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: rl1 + first ' + rl2, qrl, lst

Proof step 95 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 96 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + vs0[vtail0].next ', ps0[vs0[vtail0].next].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vtail0].deqID = None, ps0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, ps0[vtail0].val = vs0[vtail0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vs0[vtail0].next) = None, owns0(vtail0) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vtail0].next ≠ null, first ≠ vs0[vtail0].next, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[vtail0].next, vtail0 ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), vs0[vtail0].next ∈ ps0, vs0[vtail0].next ∈ vs0, vtail0 ∈ ps0, vtail0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs0[vtail0].deqID), ¬ lst ∈ rl1 + first ' + rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ vs0[vtail0].next ∈ rl1, ¬ vs0[vtail0].next ∈ rl0, ¬ vs0[vtail0].next ∈ rl2, ¬ vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs0[vtail0].next ∈ qrl ∨ vs0[vtail0].next ∈ rl, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next ⊦

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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

Proof step 97 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + vs0[vtail0].next ', ps0[vtail0].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vs0[vtail0].next].deqID = None, vs0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].val = vs0[vtail0].val, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vtail0) = None, owns0(vs0[vtail0].next) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vtail0].next ≠ null, first ≠ vs0[vtail0].next, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[vtail0].next, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vs0, vtail0 ∈ ps0, vs0[vtail0].next ∈ vs0, vs0[vtail0].next ∈ ps0, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ qrl from lst, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs0[vtail0].deqID), ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ vs0[vtail0].next ∈ rl1, ¬ vs0[vtail0].next ∈ rl0, ¬ vs0[vtail0].next ∈ rl2, ¬ vtail0 ∈ qrl from lst, ¬ vtail0 ∈ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, vs0[vtail0].next ∈ qrl ∨ vs0[vtail0].next ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] → [qrl, phead1, rl3]

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (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: qrl, phead1, y

Proof step 98 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + vs0[vtail0].next ', ps0[vs0[vtail0].next].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vtail0].deqID = None, ps0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, ps0[vtail0].val = vs0[vtail0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vs0[vtail0].next) = None, owns0(vtail0) = None, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + rl3, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vtail0].next ≠ null, first ≠ vs0[vtail0].next, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ vs0[vtail0].next, vtail0 ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vtail ∈ qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vs0[vtail0].next ∈ ps0, vs0[vtail0].next ∈ vs0, vtail0 ∈ ps0, vtail0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs0[vtail0].deqID), ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ vs0[vtail0].next ∈ rl1, ¬ vs0[vtail0].next ∈ rl0, ¬ vs0[vtail0].next ∈ rl2, ¬ vtail0 ∈ qrl from lst, ¬ vtail0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[phead1].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs0[vtail0].next ∈ qrl ∨ vs0[vtail0].next ∈ rl, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(rl3, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, 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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[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] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)

Proof step 99 from proof stable-D20 (previous step) (back to tree)

(phead1 ' + rl3) + rl = rl0 + vtail0 ' + vs0[vtail0].next ', ps0[vtail0].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vs0[vtail0].next].deqID = None, ps[phead1].deqID = None, (rl3 + rl).last = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].val = vs0[vtail0].val, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vtail0) = None, owns0(vs0[vtail0].next) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vtail0].next ≠ null, first ≠ vs0[vtail0].next, first ≠ vtail0, first ≠ lst, first ≠ phead1, phead1 ≠ vs0[vtail0].next, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[vtail0].next, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (phead1 ' + rl3) + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl3, vs, rl1 + first ' + rl2 + (phead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (phead1 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl3, ps), pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vs0, vtail0 ∈ ps0, vs0[vtail0].next ∈ vs0, vs0[vtail0].next ∈ ps0, vtail0 ∈ rl1 + first ' + rl2 + (phead1 ' + rl3) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (phead1 ' + rl3) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ phead1 ' + rl3 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ weak?(vs0[vtail0].deqID), ¬ vtail0 ∈ rl, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl3, ¬ vs0[vtail0].next ∈ rl1, ¬ vs0[vtail0].next ∈ rl0, ¬ vs0[vtail0].next ∈ rl2, ¬ vtail0 ∈ phead1 ' + rl3 from lst, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[phead1].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vs0[vtail0].next ∈ rl3 ∨ vs0[vtail0].next ∈ rl, phead1 = vtail0 ∨ phead1 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = phead1 ∨ lst ∈ rl3, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl3, vs), vtail = (phead1 ' + rl3).last ∨ vtail = (first ' + rl2 + (phead1 ' + rl3).butlast).last ∧ vs[(phead1 ' + rl3).last].deqID = None ∧ vs[(phead1 ' + rl3).last].next = null, phead1 ∈ rl0 ∨ phead1 = vtail0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ markedp([], vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) one: ⊦ x + y = a ' ∧ b ∈ x → a = b ∧ x = a ' ∧ y = []; (forward) from specification list[reflist] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ dups(a '); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 100 from proof stable-D20 (previous step) (back to tree)

(phead1 ' + rl3) + rl = rl0 + vtail0 ' + vs0[vtail0].next ', ps[phead1].deqID = None, ps0[vs0[vtail0].next].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vtail0].deqID = None, (rl3 + rl).last = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, ps0[vtail0].val = vs0[vtail0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vs0[vtail0].next) = None, owns0(vtail0) = None, pretRefs(tid) = pretRefs0(tid), rl0 = phead2 + rl4, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vtail0].next ≠ null, first ≠ vs0[vtail0].next, first ≠ vtail0, first ≠ lst, first ≠ phead1, phead1 ≠ vs0[vtail0].next, pretRefs0(tid) ≠ null, vtail0 ≠ vs0[vtail0].next, vtail0 ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (phead1 ' + rl3) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(first ' + rl2 + phead1 ' + rl3, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl3, vs, rl1 + first ' + rl2 + (phead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (phead1 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl3, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps), lst ∈ ps, lst ∈ vs, vtail ∈ phead1 ' + rl3 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (phead1 ' + rl3) + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + (phead1 ' + rl3) + rl from vtail, vs0[vtail0].next ∈ ps0, vs0[vtail0].next ∈ vs0, vtail0 ∈ ps0, vtail0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ weak?(vs0[vtail0].deqID), ¬ vtail0 ∈ rl, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl3, ¬ vs0[vtail0].next ∈ rl1, ¬ vs0[vtail0].next ∈ rl0, ¬ vs0[vtail0].next ∈ rl2, ¬ vtail0 ∈ phead1 ' + rl3 from lst, vs[phead1].deqID = Some(tid) → vhead = first ∧ success, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 ∈ rl0 ∨ phead1 = vtail0, vtail = (phead1 ' + rl3).last ∨ vtail = (first ' + rl2 + (phead1 ' + rl3).butlast).last ∧ vs[(phead1 ' + rl3).last].deqID = None ∧ vs[(phead1 ' + rl3).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl3, vs), lst = phead1 ∨ lst ∈ rl3, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, phead1 = vtail0 ∨ phead1 ∈ rl0, vs0[vtail0].next ∈ rl3 ∨ vs0[vtail0].next ∈ 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 ∈ x → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 101 from proof stable-D20 (previous step) (back to tree)

rl3 + rl = rl4 + vtail0 ' + vs0[vtail0].next ', ps[phead2].deqID = None, ps0[vs0[vtail0].next].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vtail0].deqID = None, (rl3 + rl).last = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, ps0[vtail0].val = vs0[vtail0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vs0[vtail0].next) = None, owns0(vtail0) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vtail0].next ≠ null, ps[first].next ≠ null, first ≠ phead2, first ≠ lst, first ≠ vtail0, first ≠ vs0[vtail0].next, lst ≠ phead2, phead2 ≠ vs0[vtail0].next, pretRefs0(tid) ≠ null, vtail0 ≠ phead2, vtail0 ≠ null, vtail0 ≠ vs0[vtail0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(first ' + rl2 + phead2 ' + rl3, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl4, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl4, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead2 ' + rl3, vs, rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + phead2 ' + rl3, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead2].deqID), some?(ps0[phead2].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vtail, vs0[vtail0].next ∈ ps0, vs0[vtail0].next ∈ vs0, vtail0 ∈ ps0, vtail0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, lst ∈ rl3, lst ∈ ps, lst ∈ vs, vtail ∈ rl3 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups((rl1 + rl2) + rl4), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl), ¬ weak?(vs0[vtail0].deqID), ¬ vs0[vtail0].next ∈ rl2, ¬ vs0[vtail0].next ∈ rl4, ¬ vs0[vtail0].next ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ phead2 ∈ rl3, ¬ vtail0 ∈ rl, ¬ phead2 ∈ rl1, ¬ phead2 ∈ rl4, ¬ phead2 ∈ rl2, ¬ vtail0 ∈ rl3 from lst, vs[phead2].deqID = Some(tid) → vhead = first ∧ success, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs0[vtail0].next ∈ rl3 ∨ vs0[vtail0].next ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead2 ∨ phead0 ∈ rl4 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead2 ∨ phead0 ∈ rl4, (phead2 ' + rl4).last = vhead0 ∨ (first ' + rl2 + (phead2 ' + rl4).butlast).last = vhead0 ∧ phead0 ≠ (phead2 ' + rl4).last ∧ vs0[vtail0].deqID = None, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead2].deqID = None ∧ unmarkedp(rl3, vs), vtail = rl3.last ∨ vtail = (first ' + rl2 + (phead2 ' + rl3).butlast).last ∧ vs[rl3.last].deqID = None ∧ vs[rl3.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl3, rl], <all paths>

Additional information

Used terms: rl3, rl

Proof step 102 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 103 from proof stable-D20 (previous step) (back to tree)

rl3 + rl = rl4 + vtail0 ' + vs0[vtail0].next ', ps0[vtail0].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vs0[vtail0].next].deqID = None, ps[phead2].deqID = None, (rl3 + rl).last = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].val = vs0[vtail0].val, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vtail0) = None, owns0(vs0[vtail0].next) = None, pretRefs(tid) = pretRefs0(tid), rl = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vtail0].next ≠ null, ps[first].next ≠ null, first ≠ phead2, first ≠ lst, first ≠ vtail0, first ≠ vs0[vtail0].next, lst ≠ phead2, phead2 ≠ vs0[vtail0].next, pretRefs0(tid) ≠ null, vtail0 ≠ phead2, vtail0 ≠ null, vtail0 ≠ vs0[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, ps0, owns0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead2 ' + rl3, vs, rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead2 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead2].deqID), some?(vs0[phead2].deqID), unmarkedp(rl3, ps), vtail ∈ rl3 from lst, lst ∈ vs, lst ∈ ps, lst ∈ rl3, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vs0, vtail0 ∈ ps0, vs0[vtail0].next ∈ vs0, vs0[vtail0].next ∈ ps0, vtail0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups((rl1 + rl2) + rl4), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl), ¬ weak?(vs0[vtail0].deqID), ¬ vs0[vtail0].next ∈ rl2, ¬ vs0[vtail0].next ∈ rl4, ¬ vs0[vtail0].next ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ phead2 ∈ rl3, ¬ vtail0 ∈ rl, ¬ phead2 ∈ rl1, ¬ phead2 ∈ rl4, ¬ phead2 ∈ rl2, ¬ vtail0 ∈ rl3 from lst, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[phead2].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = rl3.last ∨ vtail = (first ' + rl2 + (phead2 ' + rl3).butlast).last ∧ vs[rl3.last].deqID = None ∧ vs[rl3.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead2].deqID = None ∧ unmarkedp(rl3, vs), (phead2 ' + rl4).last = vhead0 ∨ (first ' + rl2 + (phead2 ' + rl4).butlast).last = vhead0 ∧ phead0 ≠ (phead2 ' + rl4).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead2 ∨ phead0 ∈ rl4, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead2 ∨ phead0 ∈ rl4 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, vs0[vtail0].next ∈ rl3 ∨ vs0[vtail0].next ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s)

Proof step 104 from proof stable-D20 (previous step) (back to tree)

vs[rl3.last].deqID = None, ps[phead2].deqID = None, ps0[rl3.last].deqID = None, vs0[rl3.last].deqID = None, ps0[vtail0].deqID = None, rl3.last = vs0[vtail0].next, vs[rl3.last].next = null, ps0[rl3.last].next = null, ps0[vtail0].next = rl3.last, vs0[rl3.last].next = null, ps0[rl3.last].val = vs0[rl3.last].val, ps0[vtail0].val = vs0[vtail0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(rl3.last) = None, owns0(vtail0) = None, pretRefs(tid) = pretRefs0(tid), rl3 = rl4 + vtail0 ' + rl3.last ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (phead2 ' + rl3.butlast).last ≠ rl3.last, rl3.last ≠ null, ps[first].next ≠ null, first ≠ phead2, first ≠ lst, first ≠ vtail0, first ≠ rl3.last, lst ≠ phead2, phead2 ≠ rl3.last, pretRefs0(tid) ≠ null, rl3 ≠ [], vtail0 ≠ phead2, vtail0 ≠ null, vtail0 ≠ rl3.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead2 ' + rl3, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl4, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl4, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead2 ' + rl3, vs, rl1 + first ' + rl2 + phead2 ' + rl3, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead2 ' + rl3, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + phead2 ' + rl3, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead2].deqID), some?(ps0[phead2].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + phead2 ' + rl3 from vhead, vtail0 ∈ rl1 + first ' + rl2 + phead2 ' + rl3 from (phead2 ' + rl3.butlast).last, vtail0 ∈ ps0, vtail0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, lst ∈ rl3, lst ∈ ps, lst ∈ vs, (phead2 ' + rl3.butlast).last ∈ rl3 from lst, rl3.last ∈ vs, rl3.last ∈ ps, lst ∈ vs0, rl3.last ∈ vs0, lst ∈ ps0, rl3.last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups((rl1 + rl2) + rl4), ¬ dups((rl1 + rl2) + rl3), ¬ weak?(vs0[vtail0].deqID), ¬ rl3.last ∈ rl2, ¬ rl3.last ∈ rl4, ¬ rl3.last ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ phead2 ∈ rl3, ¬ phead2 ∈ rl1, ¬ phead2 ∈ rl4, ¬ phead2 ∈ rl2, ¬ vtail0 ∈ rl3 from lst, vs[phead2].deqID = Some(tid) → vhead = first ∧ success, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead2 ∨ phead0 ∈ rl4 ∨ phead0 = vtail0 ∨ phead0 = rl3.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead2 ∨ phead0 ∈ rl4, (phead2 ' + rl4).last = vhead0 ∨ (first ' + rl2 + (phead2 ' + rl4).butlast).last = vhead0 ∧ phead0 ≠ (phead2 ' + rl4).last ∧ vs0[vtail0].deqID = None, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead2].deqID = None ∧ unmarkedp(rl3, vs) ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 105 from proof stable-D20 (previous step) (back to tree)

rl3 + rl = rl4 + vtail0 ' + vs0[vtail0].next ', ps0[vtail0].deqID = None, vs0[vs0[vtail0].next].deqID = None, ps0[vs0[vtail0].next].deqID = None, ps[phead2].deqID = None, rl.last = vs0[vtail0].next, vs0[vs0[vtail0].next].next = null, ps0[vtail0].next = vs0[vtail0].next, ps0[vs0[vtail0].next].next = null, ps0[vtail0].val = vs0[vtail0].val, ps0[vs0[vtail0].next].val = vs0[vs0[vtail0].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vtail0) = None, owns0(vs0[vtail0].next) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vtail0].next ≠ null, ps[first].next ≠ null, first ≠ phead2, first ≠ lst, first ≠ vtail0, first ≠ vs0[vtail0].next, lst ≠ phead2, phead2 ≠ vs0[vtail0].next, pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ phead2, vtail0 ≠ null, vtail0 ≠ vs0[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, ps0, owns0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead2 ' + rl3, vs, rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead2 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead2].deqID), some?(vs0[phead2].deqID), unmarkedp(rl3, ps), vtail ∈ rl3 from lst, lst ∈ vs, lst ∈ ps, lst ∈ rl3, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vs0, vtail0 ∈ ps0, vs0[vtail0].next ∈ vs0, vs0[vtail0].next ∈ ps0, vtail0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups((rl1 + rl2) + rl4), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl), ¬ weak?(vs0[vtail0].deqID), ¬ vs0[vtail0].next ∈ rl2, ¬ vs0[vtail0].next ∈ rl4, ¬ vs0[vtail0].next ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl4, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ phead2 ∈ rl3, ¬ vtail0 ∈ rl, ¬ phead2 ∈ rl1, ¬ phead2 ∈ rl4, ¬ phead2 ∈ rl2, ¬ vtail0 ∈ rl3 from lst, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[phead2].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = rl3.last ∨ vtail = (first ' + rl2 + (phead2 ' + rl3).butlast).last ∧ vs[rl3.last].deqID = None ∧ vs[rl3.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead2].deqID = None ∧ unmarkedp(rl3, vs), (phead2 ' + rl4).last = vhead0 ∨ (first ' + rl2 + (phead2 ' + rl4).butlast).last = vhead0 ∧ phead0 ≠ (phead2 ' + rl4).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead2 ∨ phead0 ∈ rl4, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead2 ∨ phead0 ∈ rl4 ∨ phead0 = vtail0 ∨ phead0 = vs0[vtail0].next, vs0[vtail0].next ∈ rl3 ∨ vs0[vtail0].next ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2 ⊦

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 ' + x).last = x.last; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ b ' ↔ a = b; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (forward) from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 106 from proof stable-D20 (previous step) (back to tree)

rl3 + rl = rl4 + vtail0 ' + rl.last ', ps0[vtail0].deqID = None, vs0[rl.last].deqID = None, ps0[rl.last].deqID = None, ps[phead2].deqID = None, rl.last = vs0[vtail0].next, vs0[rl.last].next = null, ps0[vtail0].next = rl.last, ps0[rl.last].next = null, ps0[vtail0].val = vs0[vtail0].val, ps0[rl.last].val = vs0[rl.last].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vtail0) = None, owns0(rl.last) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl.last ≠ null, ps[first].next ≠ null, first ≠ rl.last, first ≠ vtail0, first ≠ lst, first ≠ phead2, lst ≠ phead2, lst ≠ vtail0, phead2 ≠ rl.last, pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ rl.last, vtail0 ≠ null, vtail0 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead2 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, ps0, owns0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + phead2 ' + rl3, vs, rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead2 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (phead2 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead2].deqID), some?(vs0[phead2].deqID), unmarkedp(rl3, ps), vtail ∈ rl3 from lst, lst ∈ vs, lst ∈ ps, lst ∈ rl3, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vs0, vtail0 ∈ ps0, rl.last ∈ vs0, rl.last ∈ ps0, vtail0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (phead2 ' + rl3) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ rl4, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl3), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl2 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl4), ¬ dups(rl2), ¬ weak?(vs0[vtail0].deqID), ¬ vtail0 ∈ rl3 from lst, ¬ phead2 ∈ rl2, ¬ phead2 ∈ rl4, ¬ phead2 ∈ rl1, ¬ vtail0 ∈ rl, ¬ phead2 ∈ rl3, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ rl.last ∈ rl1, ¬ rl.last ∈ rl4, ¬ rl.last ∈ 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), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[phead2].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + phead2 ' + rl3, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = rl3.last ∨ vtail = (first ' + rl2 + (phead2 ' + rl3).butlast).last ∧ vs[rl3.last].deqID = None ∧ vs[rl3.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead2].deqID = None ∧ unmarkedp(rl3, vs), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 = phead2 ∨ phead0 ∈ rl4, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead2 ∨ phead0 ∈ rl4 ∨ phead0 = vtail0 ∨ phead0 = rl.last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, rl4.last = vhead0 ∨ (first ' + rl2 + (phead2 ' + rl4).butlast).last = vhead0 ∧ phead0 ≠ rl4.last ∧ vs0[vtail0].deqID = None ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead1, y

Proof step 107 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl4 + phead1 ', ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl4 ≠ [], vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl4, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, rl4.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl4), ¬ dups(rl1), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl4), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ rl4.last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 ∈ qrl ∨ phead1 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl4, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl4, vs0) ⊦

Heuristic use patterns 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] → [rl4, vhead1, rl3]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl4, vhead1, y

Proof step 108 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl4 + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl4 = rl3 + vhead1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl4 ≠ [], vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl4, ps0), unmarkedp(qrl, ps), vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl4), ¬ dups(rl1), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl4), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl4, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl4, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 ∈ qrl ∨ phead1 ∈ 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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ x + a ' ≠ []; (s)

Proof step 109 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + phead1 ', ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps0[vhead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, first ≠ vhead1, phead1 ≠ vhead1, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, vtail0 ≠ vhead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead1 ∈ qrl ∨ phead1 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = phead1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: rl1, first ' + rl2 + qrl + rl, lst

Proof step 110 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 111 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + phead1 ', ps0[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, first ≠ vhead1, phead1 ≠ vhead1, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, vtail0 ≠ vhead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ lst ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 ∈ qrl ∨ phead1 ∈ 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] 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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

Proof step 112 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + phead1 ', ps0[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vhead1, first ≠ lst, first ≠ vtail0, first ≠ phead1, phead1 ≠ vhead1, pretRefs0(tid) ≠ null, vtail0 ≠ vhead1, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(qrl, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, lst ∈ qrl, vtail ∈ qrl from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl0, ¬ lst ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ vhead1 ∈ qrl from lst, ¬ vhead1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 ∈ qrl ∨ phead1 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, (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) ⊦

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, lst0, rl4]

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (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: qrl, lst0, y

Proof step 113 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + phead1 ', ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps0[vhead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl = lst0 + rl4, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vhead1, first ≠ lst, first ≠ vtail0, first ≠ phead1, phead1 ≠ vhead1, pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ vhead1, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(rl3, ps0), lst ∈ ps, lst ∈ vs, vtail ∈ qrl from lst, lst ∈ qrl, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl0, ¬ lst ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ vhead1 ∈ qrl from lst, ¬ vhead1 ∈ 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), qrl ≠ [] ∧ vs[lst0].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(rl4, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = phead1, phead1 ∈ qrl ∨ phead1 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 114 from proof stable-D20 (previous step) (back to tree)

(lst0 ' + rl4) + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + (rl4 + rl).last ', ps[lst0].deqID = None, ps0[vtail0].deqID = None, vs0[(rl4 + rl).last].deqID = None, ps0[(rl4 + rl).last].deqID = None, ps0[vhead1].deqID = None, vs0[(rl4 + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4 + rl ≠ [], (rl4 + rl).last ≠ vhead1, ps[first].next ≠ null, first ≠ lst0, first ≠ (rl4 + rl).last, first ≠ vtail0, first ≠ lst, first ≠ vhead1, lst0 ≠ vhead1, lst0 ≠ (rl4 + rl).last, pretRefs0(tid) ≠ null, vtail0 ≠ (rl4 + rl).last, vtail0 ≠ vhead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps0), lst ∈ ps, lst ∈ vs, vtail ∈ lst0 ' + rl4 from lst, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ vhead1 ∈ lst0 ' + rl4 from lst, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ (rl4 + rl).last ∈ rl1, ¬ (rl4 + rl).last ∈ rl3, ¬ lst ∈ rl1, ¬ (rl4 + rl).last ∈ rl0, ¬ (rl4 + rl).last ∈ rl2, ¬ lst0 ∈ rl1, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl2, ¬ vhead1 ∈ rl, vs[lst0].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, vs), vtail = (lst0 ' + rl4).last ∨ vtail = (first ' + rl2 + (lst0 ' + rl4).butlast).last ∧ vs[(lst0 ' + rl4).last].deqID = None ∧ vs[(lst0 ' + rl4).last].next = null, lst = lst0 ∨ lst ∈ rl4, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = (rl4 + rl).last, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, (rl4 + rl).last ∈ rl4 ∨ (rl4 + rl).last ∈ rl, lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3 ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl4, rl], <all paths>

Additional information

Used terms: rl4, rl

Proof step 115 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 116 from proof stable-D20 (previous step) (back to tree)

(lst0 ' + rl4) + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + (rl4 + rl).last ', ps0[vhead1].deqID = None, ps0[(rl4 + rl).last].deqID = None, vs0[(rl4 + rl).last].deqID = None, ps0[vtail0].deqID = None, ps[lst0].deqID = None, vs0[(rl4 + rl).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4 + rl ≠ [], (rl4 + rl).last ≠ vhead1, ps[first].next ≠ null, first ≠ lst0, first ≠ (rl4 + rl).last, first ≠ vtail0, first ≠ lst, first ≠ vhead1, lst0 ≠ vhead1, lst0 ≠ (rl4 + rl).last, pretRefs0(tid) ≠ null, vtail0 ≠ (rl4 + rl).last, vtail0 ≠ vhead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(first ' + rl2 + lst0 ' + rl4, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(rl4, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ lst0 ' + rl4 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ vhead1 ∈ lst0 ' + rl4 from lst, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ (rl4 + rl).last ∈ rl1, ¬ (rl4 + rl).last ∈ rl3, ¬ lst ∈ rl1, ¬ (rl4 + rl).last ∈ rl0, ¬ (rl4 + rl).last ∈ rl2, ¬ lst0 ∈ rl1, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl2, ¬ vhead1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst0].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3, (rl4 + rl).last ∈ rl4 ∨ (rl4 + rl).last ∈ rl, lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = (rl4 + rl).last, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, lst = lst0 ∨ lst ∈ rl4, vtail = (lst0 ' + rl4).last ∨ vtail = (first ' + rl2 + (lst0 ' + rl4).butlast).last ∧ vs[(lst0 ' + rl4).last].deqID = None ∧ vs[(lst0 ' + rl4).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, 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 ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 117 from proof stable-D20 (previous step) (back to tree)

lst0 ' + rl4 = rl0 + vtail0 ' + rl3 + vhead1 ' + rl4.last ', vs[rl4.last].deqID = None, ps[lst0].deqID = None, ps0[vtail0].deqID = None, vs0[rl4.last].deqID = None, ps0[rl4.last].deqID = None, ps0[vhead1].deqID = None, vs[rl4.last].next = null, vs0[rl4.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (lst0 ' + rl4.butlast).last ≠ rl4.last, rl4.last ≠ vhead1, ps[first].next ≠ null, first ≠ lst0, first ≠ rl4.last, first ≠ vtail0, first ≠ lst, first ≠ vhead1, lst ≠ lst0, lst0 ≠ vhead1, lst0 ≠ rl4.last, pretRefs0(tid) ≠ null, rl4 ≠ [], vtail0 ≠ vhead1, vtail0 ≠ rl4.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + lst0 ' + rl4, vs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps0), lst ∈ ps0, lst ∈ vs0, (lst0 ' + rl4.butlast).last ∈ rl4 from lst, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + lst0 ' + rl4 from (lst0 ' + rl4.butlast).last, vhead0 ∈ rl1 + first ' + rl2 + lst0 ' + rl4 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ rl4, lst ∈ ps, lst ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ vhead1 ∈ rl4 from lst, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ rl4.last ∈ rl1, ¬ rl4.last ∈ rl3, ¬ lst ∈ rl1, ¬ rl4.last ∈ rl0, ¬ rl4.last ∈ rl2, ¬ lst0 ∈ rl1, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl2, vs[lst0].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = rl4.last, lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3, (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, vs) ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ x → (a ' + x = y + a ' + z ↔ y = [] ∧ z = x); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ y → a ∈ x + y; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl4, phead1, y

Proof step 118 from proof stable-D20 (previous step) (back to tree)

(lst0 ' + rl4) + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + rl.last ', ps0[vhead1].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, ps[lst0].deqID = None, vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4 + rl ≠ [], rl.last ≠ vhead1, ps[first].next ≠ null, first ≠ lst0, first ≠ rl.last, first ≠ vtail0, first ≠ lst, first ≠ vhead1, lst0 ≠ vhead1, lst0 ≠ rl.last, pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ rl.last, vtail0 ≠ vhead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(first ' + rl2 + lst0 ' + rl4, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(rl4, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ lst0 ' + rl4 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ vhead1 ∈ lst0 ' + rl4 from lst, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ rl.last ∈ rl1, ¬ rl.last ∈ rl3, ¬ lst ∈ rl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl2, ¬ lst0 ∈ rl1, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl2, ¬ vhead1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst0].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3, rl.last ∈ rl4 ∨ rl.last ∈ rl, lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = rl.last, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, lst = lst0 ∨ lst ∈ rl4, vtail = (lst0 ' + rl4).last ∨ vtail = (first ' + rl2 + (lst0 ' + rl4).butlast).last ∧ vs[(lst0 ' + rl4).last].deqID = None ∧ vs[(lst0 ' + rl4).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, 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.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist]

Proof step 119 from proof stable-D20 (previous step) (back to tree)

(lst0 ' + rl4) + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + rl.last ', ps0[vhead1].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, ps[lst0].deqID = None, vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4 + rl ≠ [], rl.last ≠ vhead1, ps[first].next ≠ null, first ≠ vhead1, first ≠ lst, first ≠ vtail0, first ≠ rl.last, first ≠ lst0, lst0 ≠ rl.last, lst0 ≠ vhead1, pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ vhead1, vtail0 ≠ rl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(first ' + rl2 + lst0 ' + rl4, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(rl3, ps0), unmarkedp(rl4, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ lst0 ' + rl4 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl2 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl4), ¬ dups(rl2), ¬ vhead1 ∈ rl, ¬ lst0 ∈ rl2, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl1, ¬ rl.last ∈ rl2, ¬ rl.last ∈ rl0, ¬ lst ∈ rl1, ¬ rl.last ∈ rl3, ¬ rl.last ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ vhead1 ∈ lst0 ' + rl4 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst0].deqID = Some(tid) → vhead = first ∧ success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = rl.last, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, lst = lst0 ∨ lst ∈ rl4, vtail = (lst0 ' + rl4).last ∨ vtail = (first ' + rl2 + (lst0 ' + rl4).butlast).last ∧ vs[(lst0 ' + rl4).last].deqID = None ∧ vs[(lst0 ' + rl4).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, vs), lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3 ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) 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] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead1, y

Proof step 120 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ lst ∈ rl2, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

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

Proof step 121 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ lst ∈ rl2, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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) ⊦

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, phead1, rl3]

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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 + b ' + y).last = (b ' + y).last; (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) ⊦ a ' + x ≠ []; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y

Proof step 122 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[first].next = ps0[first].next

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs

Proof step 123 from proof stable-D20 (previous step) (back to tree)

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

Proof step 124 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ (rl1 + first ' + rl2) + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[((rl1 + first ' + rl2) + qrl).last].next ≠ null → vs0[((rl1 + first ' + rl2) + qrl).last].next = vs[((rl1 + first ' + rl2) + qrl).last].next ∧ vs0[vs0[((rl1 + first ' + rl2) + qrl).last].next].val = vs[vs0[((rl1 + first ' + rl2) + qrl).last].next].val), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[first].next = ps0[first].next

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

Proof step 125 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[first].next = ps0[first].next

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 86 terms: first abort: F discard: F computed: T

Additional information

Used terms: first

Proof step 126 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ first = first ∨ first ∈ rl2 ∨ first ∈ qrl → vs[first].val = vs0[first].val ∧ ps[first].val = ps0[first].val ∧ (vs[first].deqID ≠ None → vs0[first].deqID = vs[first].deqID) ∧ (ps[first].deqID ≠ None → ps0[first].deqID = ps[first].deqID) ∧ (vs[first].next ≠ null → vs0[first].next = vs[first].next) ∧ (ps[first].next ≠ null → ps0[first].next = ps[first].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[first].next = ps0[first].next

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as)

Proof step 127 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 91 terms: vs[first].next abort: F discard: F computed: F

Additional information

Used terms: vs[first].next

Proof step 128 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps[first].next

Proof step 129 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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] → [ps0, (rl1 + first ' + rl2) + rl0, owns0, vhead0, qrl0, vs0]

Additional information

Used terms: ps0, (rl1 + first ' + rl2) + rl0, owns0, vhead0, qrl0, vs0

Proof step 130 from proof stable-D20 (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 131 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0) ∧ vhead0 ∈ (rl1 + first ' + rl2) + rl0 → (∃ rl3, rl4. (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4 ∧ listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0)), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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

Proof step 132 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 → (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4 ∧ listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0

Additional information

Used formulas: vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0

Proof step 133 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 → (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4 ∧ listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 134 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first ', rl2 + rl0], <all paths>

Additional information

Used terms: first ', rl2 + rl0

Proof step 135 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 136 from proof stable-D20 (previous step) (back to tree)

rl2 + rl0 = [], (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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 → (x + y).head = x.head; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as)

Proof step 137 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), listp((rl1 + first ') + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + qrl, vs, (rl1 + first ') + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ ps, lst ∈ vs, lst ∈ qrl, vtail ∈ rl1 + first ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + qrl + rl), ¬ dups(rl1), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ first ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → success, vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ noid(tid, rl1 + first ' + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl1 ∨ vhead0 = first, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (first ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, first ∈ rl3 ∨ first = vhead0 ∨ first ∈ rl4, vhead0 = first ∨ vhead0 ∈ qrl ∨ vhead0 ∈ rl, (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, first = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = vhead0 ∧ phead0 ≠ first ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0) ⊦ vhead0 = first ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ noid(tid, (rl3 + first ' + rl4) + qrl + rl, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + first ' + rl4) + qrl + rl, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl + rl ≠ [] ∧ vs0[qrl.head].deqID = Some(tid) → success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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, vtail1, qrl0]

Additional information

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

Proof step 138 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = rl3 + vhead0 ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vtail1 + qrl0, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ') + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + qrl, vs, (rl1 + first ') + qrl + rl, vs0), nonullRetRefs((rl1 + first ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl1 + first ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, lst ∈ qrl, lst ∈ vs, lst ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + qrl + rl), ¬ dups(rl1), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ first ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, qrl ≠ [] ∧ vs[vtail1].deqID = Some(tid) → success, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ noid(tid, rl1 + first ' + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), first = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = vhead0 ∧ phead0 ≠ first ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs), vhead0 = first ∨ vhead0 ∈ qrl ∨ vhead0 ∈ rl, first ∈ rl3 ∨ first = vhead0 ∨ first ∈ rl4, vtail0 = (first ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (first ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first, phead ∈ rl1 ∨ phead = first, vhead0 ∈ rl1 ∨ vhead0 = first ⊦ vhead0 = first ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ noid(tid, (rl3 + first ' + rl4) + qrl + rl, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + first ' + rl4) + qrl + rl, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl + rl ≠ [] ∧ vs0[vtail1].deqID = Some(tid) → success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ c ∈ y ∧ c ≠ b → y + b ' ≠ y0 + c ' + z; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (a ' + x).tail = x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)

Proof step 139 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, ps[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, vhead0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl0, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl0) + rl, vs0, ps0, owns0), listp(vhead0 ' + rl4 + (vs[first].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + vs[first].next ' + qrl0, vs, rl1 + first ' + (vs[first].next ' + qrl0) + rl, vs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ ps, lst ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + rl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl0 + rl), ¬ dups(rl1 + qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ qrl0, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].deqID = Some(tid) → success, vs[(vs[first].next ' + qrl0).last].next ≠ null → vs0[(vs[first].next ' + qrl0).last].next = vs[(vs[first].next ' + qrl0).last].next ∧ vs0[vs0[(vs[first].next ' + qrl0).last].next].val = vs[vs0[(vs[first].next ' + qrl0).last].next].val, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[vs[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val) ∧ noid(tid, rl1 + first ' + vs[first].next ' + qrl0, vs[first].next, vs) ;vs[vs[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl0 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl ∨ vhead0 ∈ qrl0 ∨ vhead0 = first, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl0 ∨ phead0 ∈ rl, 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, vtail0 = (vs[first].next ' + qrl0 + rl).last ∨ vtail0 = (first ' + ((vs[first].next ' + qrl0) + rl).butlast).last ∧ vs0[((vs[first].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((vs[first].next ' + qrl0) + rl).last].next = null, vhead0 ∈ rl1 ∨ vhead0 = first, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first, first ∈ rl3 ∨ first = vhead0 ∨ first ∈ rl4, first = vhead0 ∧ unmarkedp(qrl0, vs0) ∧ unmarkedp(rl, vs0) ∨ rl1 ≠ [] ∧ rl1.last = vhead0 ∧ phead0 ≠ first ∧ vs0[vs[first].next].deqID = None ∧ unmarkedp(qrl0, vs0) ∧ unmarkedp(rl, vs0) ⊦ vhead0 = first ∧ (success ⊃ vs0[vs[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val) ∧ noid(tid, rl3 + first ' + rl4 + (vs[first].next ' + qrl0) + rl, vs[first].next, vs0) ; vs0[vs[first].next].deqID ≠ None ∧ noid(tid, rl3 + first ' + rl4 + (vs[first].next ' + qrl0) + rl, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (vs0[vs[first].next].deqID = Some(tid) → success)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 105

Additional information

Used simplifier rules: in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 140 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = rl3 + vhead0 ' + rl4, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = vs0[first].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, first = vhead0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, vhead0 ≠ vs[first].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + (vs[first].next ' + qrl0) + rl, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + qrl0) + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps, owns), listp(vs[first].next ' + qrl0, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + vs[first].next ' + qrl0, vs, rl1 + first ' + (vs[first].next ' + qrl0) + rl, vs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), unmarkedp(qrl0, vs), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl1 + first ' + (vs[first].next ' + qrl0) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, lst ∈ vs, lst ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + rl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl0 + rl), ¬ dups(rl1 + qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[(vs[first].next ' + qrl0).last].next ≠ null → vs0[(vs[first].next ' + qrl0).last].next = vs[(vs[first].next ' + qrl0).last].next ∧ vs0[vs0[(vs[first].next ' + qrl0).last].next].val = vs[vs0[(vs[first].next ' + qrl0).last].next].val, vs[vs[first].next].deqID = Some(tid) → success, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), (success ⊃ vs[vs[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val) ∧ noid(tid, rl1 + first ' + vs[first].next ' + qrl0, vs[first].next, vs) ;vs[vs[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl0 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), first ∈ rl3 ∨ first = vhead0 ∨ first ∈ rl4, phead0 ∈ rl1 ∨ phead0 = first, phead ∈ rl1 ∨ phead = first, vhead0 ∈ rl1 ∨ vhead0 = first, vtail0 = (vs[first].next ' + qrl0 + rl).last ∨ vtail0 = (first ' + ((vs[first].next ' + qrl0) + rl).butlast).last ∧ vs0[((vs[first].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((vs[first].next ' + qrl0) + rl).last].next = null, 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, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl0 ∨ phead0 ∈ rl, vhead0 ∈ rl ∨ vhead0 ∈ qrl0 ∨ vhead0 = first ⊦ vhead0 = first ∧ (success ⊃ vs0[vs[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val) ∧ noid(tid, rl3 + first ' + rl4 + (vs[first].next ' + qrl0) + rl, vs[first].next, vs0) ; vs0[vs[first].next].deqID ≠ None ∧ noid(tid, rl3 + first ' + rl4 + (vs[first].next ' + qrl0) + rl, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (vs0[vs[first].next].deqID = Some(tid) → success)

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 = 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) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws)

Proof step 141 from proof stable-D20 (previous step) (back to tree)

vs0[vhead0].deqID = vs[vhead0].deqID, ps0[vhead0].deqID = vs[vhead0].deqID, ps[vs[vhead0].next].deqID = None, ps0[vs[vhead0].next].deqID = None, ps[vhead0].deqID = vs[vhead0].deqID, ps0[vhead0].next = vs[vhead0].next, vs0[vhead0].next = vs[vhead0].next, ps[vhead0].next = vs[vhead0].next, ps0[vhead0].val = vs0[vhead0].val, vs[vhead0].val = vs0[vhead0].val, ps[vhead0].val = vs0[vhead0].val, vs[vs[vhead0].next].val = vs0[vs[vhead0].next].val, ps[vs[vhead0].next].val = ps0[vs[vhead0].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vhead0) = None, owns0(vhead0) = None, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[vhead0].next ≠ null, pretRefs0(tid) ≠ null, vhead0 ≠ lst, vhead0 ≠ null, vhead0 ≠ vs[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vhead0].next ' + qrl0 + rl, vs0, ps0, owns0), listp(vs[vhead0].next ' + qrl0, vs, ps, owns), listp(rl1 + vhead0 ' + vs[vhead0].next ' + qrl0, vs, ps, owns), listp(rl1 + vhead0 ' + (vs[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, vhead0, vs, vhead0, vs0), noidRely(tid, rl1 + vhead0 ' + vs[vhead0].next ' + qrl0, vs, rl1 + vhead0 ' + (vs[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl1 + vhead0 ' + vs[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + vhead0 ' + (vs[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs), vhead0 ∈ ps, vhead0 ∈ vs, vhead0 ∈ ps0, vhead0 ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ ps, lst ∈ vs, vtail ∈ rl1 + vhead0 ' + vs[vhead0].next ' + qrl0 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + vhead0 ' + (vs[vhead0].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + rl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl0 + rl), ¬ dups(rl1 + qrl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl, ¬ vs[vhead0].next ∈ qrl0, ¬ vs[vhead0].next ∈ rl1, ¬ vs[vhead0].next ∈ rl, ¬ vhead0 ∈ qrl0, vs0[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs[vhead0].next].deqID.tid)) = Claimed(vs0[vs[vhead0].next].deqID.tid, vs0[vs[vhead0].next].val), vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs0[vs[vhead0].next].val), vs[vs[vhead0].next].deqID ≠ None → vs0[vs[vhead0].next].deqID = vs[vs[vhead0].next].deqID, vs[vs[vhead0].next].next ≠ null → vs0[vs[vhead0].next].next = vs[vs[vhead0].next].next, ps[vs[vhead0].next].next ≠ null → ps0[vs[vhead0].next].next = ps[vs[vhead0].next].next, vs[vs[vhead0].next].deqID = Some(tid) → success, vs[(vs[vhead0].next ' + qrl0).last].next ≠ null → vs0[(vs[vhead0].next ' + qrl0).last].next = vs[(vs[vhead0].next ' + qrl0).last].next ∧ vs0[vs0[(vs[vhead0].next ' + qrl0).last].next].val = vs[vs0[(vs[vhead0].next ' + qrl0).last].next].val, (success ⊃ vs[vs[vhead0].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[vhead0].next].val) ∧ noid(tid, rl1 + vhead0 ' + vs[vhead0].next ' + qrl0, vs[vhead0].next, vs) ;vs[vs[vhead0].next].deqID ≠ None ∧ noid(tid, rl1 + vhead0 ' + vs[vhead0].next ' + qrl0, vhead0, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r = vs[vhead0].next ∨ r ∈ qrl0 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + vhead0 ' from phead ∨ phead0 = vs[vhead0].next ∨ phead0 ∈ qrl0 ∨ phead0 ∈ rl, lst = vs[vhead0].next ∨ lst ∈ qrl0, vtail = (vs[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (vs[vhead0].next ' + qrl0).butlast).last ∧ vs[(vs[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(vs[vhead0].next ' + qrl0).last].next = null, vtail0 = (vs[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((vs[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((vs[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((vs[vhead0].next ' + qrl0) + rl).last].next = null, phead ∈ rl1 ∨ phead = vhead0, phead0 ∈ rl1 ∨ phead0 = vhead0 ⊦ (success ⊃ vs0[vs[vhead0].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs[vhead0].next].val) ∧ noid(tid, rl1 + vhead0 ' + vs[vhead0].next ' + qrl0 + rl, vs[vhead0].next, vs0) ; vs0[vs[vhead0].next].deqID ≠ None ∧ noid(tid, rl1 + vhead0 ' + vs[vhead0].next ' + qrl0 + rl, vhead0, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (vs0[vs[vhead0].next].deqID = Some(tid) → success)

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 95

Additional information

Used simplifier rules: ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, first, vs) → noid(tid, orl + rl0 + qrl0, first, vs0); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Pending(tid) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Pending(tid) ↔ true); (ss) ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Claimed(othertid, v) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Claimed(othertid, v) ↔ true); (ss) ⊦ None ≠ Some(tid); (s)

Proof step 142 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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 ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 143 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl

Additional information

Used formulas: vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl

Proof step 144 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 145 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl

Additional information

Used formulas: ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl

Proof step 146 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 147 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 105

Additional information

Proof step 148 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), success, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Claimed(othertid, v) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Claimed(othertid, v) ↔ true); (ss)

Proof step 149 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noidRely-def, seq:⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)), subst:[rl, tid, vs0, rl0, vs] → [(rl1 + first ' + rl2) + qrl, tid, vs0, (rl3 + vhead0 ' + rl4) + qrl0, vs], <all paths>

Additional information

Used terms: (rl1 + first ' + rl2) + qrl, tid, vs0, (rl3 + vhead0 ' + rl4) + qrl0, vs

Proof step 150 from proof stable-D20 (previous step) (back to tree)

⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))

A spec-lemma

Proof step 151 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. noid(tid, (rl1 + first ' + rl2) + qrl, r, vs) → noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, r, vs0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps[first].next

Proof step 152 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) → noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first)

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]

Proof step 153 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0], <all paths>

Additional information

Used terms: tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0

Proof step 154 from proof stable-D20 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 155 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: vhead0 = first

Additional information

Used formulas: vhead0 = first

Proof step 156 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 157 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ nextnottid(tid, vhead0, vs0) ∧ (vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:nextnottid-def, seq:⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), subst:[tid, vhead, vs] → [tid, vhead0, vs0], <all paths>

Additional information

Used terms: tid, vhead0, vs0

Proof step 158 from proof stable-D20 (previous step) (back to tree)

⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)

A spec-lemma

Proof step 159 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 109 terms: vs0[vhead0].next abort: F discard: F computed: T

Additional information

Used terms: vs0[vhead0].next

Proof step 160 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 111 terms: qrl0.head abort: F discard: F computed: F

Additional information

Used terms: qrl0.head

Proof step 161 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 124

Additional information

Proof step 162 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), (rl2 + rl0).last = vhead0, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 163 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + (rl2 + rl0).last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (rl2 + rl0).last ≠ first, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((rl2 + rl0).last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, (rl2 + rl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[(rl2 + rl0).last].next ≠ ps[first].next ∧ vs0[(rl2 + rl0).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(rl2 + rl0).last].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(rl2 + rl0).last].next ≠ null ∧ vs0[vs0[(rl2 + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl0).last].next].deqID.tid, vs0[vs0[(rl2 + rl0).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last ∈ rl1 ∨ (rl2 + rl0).last ∈ rl2 ∨ (rl2 + rl0).last ∈ rl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[(rl2 + rl0).last].next ≠ null → vs0[vs0[(rl2 + rl0).last].next].deqID ≠ Some(tid)) ∧ ((rl2 + rl0).last ∈ rl2 ∨ (rl2 + rl0).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0], <all paths>

Additional information

Used terms: rl2, rl0

Proof step 164 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 165 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + (rl2 + rl0).last ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (rl2 + rl0).last ≠ first, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl2 + rl0).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, (rl2 + rl0).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (rl2 + rl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(rl2 + rl0).last].next ≠ null ∧ vs0[vs0[(rl2 + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl0).last].next].deqID.tid, vs0[vs0[(rl2 + rl0).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[(rl2 + rl0).last].next ≠ ps[first].next ∧ vs0[(rl2 + rl0).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(rl2 + rl0).last].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, (rl2 + rl0).last ∈ rl1 ∨ (rl2 + rl0).last ∈ rl2 ∨ (rl2 + rl0).last ∈ rl0 ⊦ (vs0[(rl2 + rl0).last].next ≠ null → vs0[vs0[(rl2 + rl0).last].next].deqID ≠ Some(tid)) ∧ ((rl2 + rl0).last ∈ rl2 ∨ (rl2 + rl0).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 166 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + rl2.last ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2.last ≠ first, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl2.last ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, rl2.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), rl2.last ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, vs0[rl2.last].next ≠ null ∧ vs0[vs0[rl2.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl2.last].next].deqID.tid)) = Claimed(vs0[vs0[rl2.last].next].deqID.tid, vs0[vs0[rl2.last].next].val), vs0[rl2.last].next ≠ ps[first].next ∧ vs0[rl2.last].next ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[vs0[rl2.last].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ (vs0[rl2.last].next ≠ null → vs0[vs0[rl2.last].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic use patterns 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, phead1, qrl0]

Additional information

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

Proof step 167 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + phead1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = qrl0 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 168 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, phead1 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + (qrl0 + phead1 ') + qrl + rl, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1, first ' + (qrl0 + phead1 ') + qrl + rl, vhead

Proof step 169 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 170 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 171 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, phead1 ∈ first ' + qrl0 + phead1 ' + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [first ', qrl0 + phead1 ' + qrl + rl, vhead], <all paths>

Additional information

Used terms: first ', qrl0 + phead1 ' + qrl + rl, vhead

Proof step 172 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 173 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ first ' + qrl0 + phead1 ' + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ first ', ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 174 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl0 ∨ vhead = phead1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl0, phead1, rl3 + phead1 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl0, phead1, rl3 + phead1 ' + rl4

Proof step 175 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 176 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = (rl3 + phead1 ' + rl4).butlast, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, phead1 = (rl3 + phead1 ' + rl4).last, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + phead1 ' + rl4 ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ qrl0 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 177 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = rl3 + (phead1 ' + rl4).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, phead1 = (phead1 ' + rl4).last, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl0 ∨ vhead = phead1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [phead1 ', rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', rl4

Proof step 178 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 179 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = rl3 + (phead1 ' + rl4).butlast, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, phead1 = (phead1 ' + rl4).last, pretRefs(tid) = pretRefs0(tid), rl4 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ qrl0 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 + [] = x; (s) ⊦ [] + x = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 180 from proof stable-D20 (previous step) (back to tree)

vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + qrl + rl, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl0) + phead1 ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl0) + phead1 ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vhead ∈ qrl0 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 181 from proof stable-D20 (previous step) (back to tree)

ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp(phead1 ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl0) + phead1 ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0) + phead1 ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl0 ∨ vhead = phead1, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s)

Proof step 182 from proof stable-D20 (previous step) (back to tree)

ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + qrl0 + phead1 ', vs, ps, owns), listp(phead1 ' + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(rl, ps0), phead1 ∈ qrl0 + phead1 ' + rl from vhead, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl0 + rl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, rl ≠ [] → unmarkedp(rl.tail, vs0), vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, rl.head ≠ ps[first].next ∧ rl.head ∈ rl1 + first ' + qrl0 + phead1 ' + rl from ps[first].next → vs0[rl.head].deqID ≠ Some(tid), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + qrl0 + phead1 ' + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl0 + phead1 ' + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1, vtail0 = (phead1 ' + rl).last ∨ rl ≠ [] ∧ vtail0 = (phead1 ' + rl.butlast).last ∧ vs0[rl.last].deqID = None ∧ vs0[rl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vhead ∈ qrl0 ∨ vhead = phead1, lst ∈ qrl0 ∨ lst = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ rl, vtail0 = phead1 ∨ vtail0 ∈ rl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (rl = [] ∨ vs0[rl.head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 183 from proof stable-D20 (previous step) (back to tree)

vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = first0 + rl0, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), listp(rl1 + first ' + qrl0 + phead1 ' + rl, vs0, ps0, owns0), listp(phead1 ' + rl, vs0, ps0, owns0), listp(first ' + qrl0 + phead1 ', vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ qrl0 + phead1 ' + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl0 + rl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + qrl0 + phead1 ' + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), rl.head ≠ ps[first].next ∧ rl.head ∈ rl1 + first ' + qrl0 + phead1 ' + rl from ps[first].next → vs0[rl.head].deqID ≠ Some(tid), vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, rl ≠ [] → unmarkedp(rl.tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl0 + phead1 ' + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = phead1 ∨ vtail0 ∈ rl, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1, lst ∈ qrl0 ∨ lst = phead1, vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail0 = (phead1 ' + rl).last ∨ rl ≠ [] ∧ vtail0 = (phead1 ' + rl.butlast).last ∧ vs0[rl.last].deqID = None ∧ vs0[rl.last].next = null, phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (rl = [] ∨ vs0[rl.head].deqID ≠ Some(tid))

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 a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (a ' + x).head = a; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s)

Proof step 184 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[phead1].next].deqID = Some(tid), ps0[phead1].deqID = vs0[phead1].deqID, ps0[vs0[phead1].next].deqID = None, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[phead1].next = vs0[phead1].next, ps0[first].next = ps[first].next, ps0[phead1].val = vs0[phead1].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ vs0[phead1].next, phead1 ≠ null, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(first ' + qrl0 + phead1 ', vs, ps, owns), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), phead1 ∈ ps0, phead1 ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + rl0), ¬ weak?(vs0[phead1].deqID), ¬ phead1 ∈ rl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vs0[phead1].next ∈ qrl0, ¬ vs0[phead1].next ∈ rl0, ¬ vhead ∈ rl1, ¬ first ∈ qrl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, vs0[phead1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[phead1].next].val), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1, lst ∈ qrl0 ∨ lst = phead1, vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1, vtail0 = phead1 ∨ vtail0 = vs0[phead1].next ∨ vtail0 ∈ rl0, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 = vs0[phead1].next ∨ phead0 ∈ rl0, vtail0 = (vs0[phead1].next ' + rl0).last ∨ vtail0 = (phead1 ' + (vs0[phead1].next ' + rl0).butlast).last ∧ vs0[(vs0[phead1].next ' + rl0).last].deqID = None ∧ vs0[(vs0[phead1].next ' + rl0).last].next = null ⊦ vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, ps[first].next], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ 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] Used terms: rl1, first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, ps[first].next

Proof step 185 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 186 from proof stable-D20 (previous step) (back to tree)

ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vs0[phead1].next].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps0[phead1].next = vs0[phead1].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ vs0[phead1].next, phead1 ≠ null, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), listp(first ' + qrl0 + phead1 ', vs, ps, owns), listp(vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs0), phead1 ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from vhead, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, phead1 ∈ vs0, phead1 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + rl0), ¬ weak?(vs0[phead1].deqID), ¬ ps[first].next ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vs0[phead1].next ∈ qrl0, ¬ vs0[phead1].next ∈ rl0, ¬ vhead ∈ rl1, ¬ first ∈ qrl0, vs0[phead1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[phead1].next].val), vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (vs0[phead1].next ' + rl0).last ∨ vtail0 = (phead1 ' + (vs0[phead1].next ' + rl0).butlast).last ∧ vs0[(vs0[phead1].next ' + rl0).last].deqID = None ∧ vs0[(vs0[phead1].next ' + rl0).last].next = null, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 = vs0[phead1].next ∨ phead0 ∈ rl0, vtail0 = phead1 ∨ vtail0 = vs0[phead1].next ∨ vtail0 ∈ rl0, phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vhead ∈ qrl0 ∨ vhead = phead1, lst ∈ qrl0 ∨ lst = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ⊦ vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next

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] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 187 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[phead1].next].deqID = Some(tid), ps0[phead1].deqID = vs0[phead1].deqID, ps0[vs0[phead1].next].deqID = None, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[phead1].next = vs0[phead1].next, ps0[first].next = ps[first].next, ps0[phead1].val = vs0[phead1].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ vs0[phead1].next, phead1 ≠ null, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(first ' + qrl0 + phead1 ', vs, ps, owns), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), phead1 ∈ ps0, phead1 ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + rl0), ¬ weak?(vs0[phead1].deqID), ¬ ps[first].next ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vs0[phead1].next ∈ qrl0, ¬ vs0[phead1].next ∈ rl0, ¬ vhead ∈ rl1, ¬ first ∈ qrl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, vs0[phead1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[phead1].next].val), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1, lst ∈ qrl0 ∨ lst = phead1, vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1, vtail0 = phead1 ∨ vtail0 = vs0[phead1].next ∨ vtail0 ∈ rl0, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 = vs0[phead1].next ∨ phead0 ∈ rl0, vtail0 = (vs0[phead1].next ' + rl0).last ∨ vtail0 = (phead1 ' + (vs0[phead1].next ' + rl0).butlast).last ∧ vs0[(vs0[phead1].next ' + rl0).last].deqID = None ∧ vs0[(vs0[phead1].next ' + rl0).last].next = null, ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ⊦ vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [first ', qrl0 + phead1 ' + vs0[phead1].next ' + rl0, ps[first].next], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (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] Used terms: first ', qrl0 + phead1 ' + vs0[phead1].next ' + rl0, ps[first].next

Proof step 188 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 189 from proof stable-D20 (previous step) (back to tree)

ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vs0[phead1].next].deqID = None, ps0[phead1].deqID = vs0[phead1].deqID, vs0[vs0[phead1].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps0[phead1].next = vs0[phead1].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[phead1].val = vs0[phead1].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ vs0[phead1].next, phead1 ≠ null, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), listp(first ' + qrl0 + phead1 ', vs, ps, owns), listp(vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs0), phead1 ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from vhead, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, phead1 ∈ vs0, phead1 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + rl0), ¬ weak?(vs0[phead1].deqID), ¬ ps[first].next ∈ first ', ¬ ps[first].next ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vs0[phead1].next ∈ qrl0, ¬ vs0[phead1].next ∈ rl0, ¬ vhead ∈ rl1, ¬ first ∈ qrl0, vs0[phead1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[phead1].next].val), vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ qrl0 ∨ ps[first].next = phead1, vtail0 = (vs0[phead1].next ' + rl0).last ∨ vtail0 = (phead1 ' + (vs0[phead1].next ' + rl0).butlast).last ∧ vs0[(vs0[phead1].next ' + rl0).last].deqID = None ∧ vs0[(vs0[phead1].next ' + rl0).last].next = null, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 = vs0[phead1].next ∨ phead0 ∈ rl0, vtail0 = phead1 ∨ vtail0 = vs0[phead1].next ∨ vtail0 ∈ rl0, phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vhead ∈ qrl0 ∨ vhead = phead1, lst ∈ qrl0 ∨ lst = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ⊦ vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next

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] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 190 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[phead1].next].deqID = Some(tid), ps0[phead1].deqID = vs0[phead1].deqID, ps0[vs0[phead1].next].deqID = None, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[phead1].next = vs0[phead1].next, ps0[first].next = ps[first].next, ps0[phead1].val = vs0[phead1].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[first].next ≠ first, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ vs0[phead1].next, phead1 ≠ null, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(vs0[phead1].next ' + rl0, vs0, ps0, owns0), listp(first ' + qrl0 + phead1 ', vs, ps, owns), listp(rl1 + first ' + qrl0 + phead1 ', vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ', vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), phead1 ∈ ps0, phead1 ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead1 ∈ rl1 + first ' + qrl0 + phead1 ' from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + rl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + rl0), ¬ weak?(vs0[phead1].deqID), ¬ ps[first].next ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[phead1].next ∈ rl1, ¬ vs0[phead1].next ∈ qrl0, ¬ vs0[phead1].next ∈ rl0, ¬ vhead ∈ rl1, ¬ first ∈ qrl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null → vs0[phead1].next = vs[phead1].next ∧ vs0[vs0[phead1].next].val = vs[vs0[phead1].next].val, vs0[phead1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[phead1].next].val), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1, lst ∈ qrl0 ∨ lst = phead1, vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead1 = vhead ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1, vtail0 = phead1 ∨ vtail0 = vs0[phead1].next ∨ vtail0 ∈ rl0, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 = vs0[phead1].next ∨ phead0 ∈ rl0, vtail0 = (vs0[phead1].next ' + rl0).last ∨ vtail0 = (phead1 ' + (vs0[phead1].next ' + rl0).butlast).last ∧ vs0[(vs0[phead1].next ' + rl0).last].deqID = None ∧ vs0[(vs0[phead1].next ' + rl0).last].next = null, ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ⊦ vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ qrl0 + phead1 ' + vs0[phead1].next ' + rl0 from ps[first].next

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

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(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) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ None ≠ Some(tid); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ some?(Some(tid)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ markedp([], vs); (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) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (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) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 191 from proof stable-D20 (previous step) (back to tree)

ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = first0 + qrl1, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp(phead1 ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl0) + phead1 ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ qrl0 + phead1 ' + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0) + phead1 ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl0 ∨ vhead = phead1, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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

Proof step 192 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[phead1].next].deqID = Some(tid), ps0[phead1].deqID = vs0[phead1].deqID, ps[vs0[phead1].next].deqID = None, ps0[vs0[phead1].next].deqID = None, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps[phead1].next = vs0[phead1].next, ps0[phead1].next = vs0[phead1].next, ps0[first].next = ps[first].next, ps0[phead1].val = vs0[phead1].val, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(phead1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[vs0[phead1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ phead1, ps[first].next ≠ null, first ≠ vs0[phead1].next, first ≠ lst, phead1 ≠ vs0[phead1].next, phead1 ≠ null, phead1 ≠ first, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1, vs, ps, owns), listp(vs0[phead1].next ' + qrl1 + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + (vs0[phead1].next ' + qrl1) + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + (vs0[phead1].next ' + qrl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps), unmarkedp(qrl1, ps0), unmarkedp(rl, ps0), phead1 ∈ ps0, phead1 ∈ vs0, phead1 ∈ qrl0 + phead1 ' + (vs0[phead1].next ' + qrl1) + rl from vhead, vtail0 ∈ rl1 + first ' + qrl0 + phead1 ' + (vs0[phead1].next ' + qrl1) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0 + qrl1), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl0 + qrl1), ¬ dups(qrl1 + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl1 + rl), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + qrl1 + rl), ¬ dups((rl1 + qrl0) + qrl1), ¬ weak?(vs0[phead1].deqID), ¬ vs0[phead1].next ∈ first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1 + rl from ps[first].next, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl, ¬ first ∈ qrl1, ¬ first ∈ qrl0, ¬ vhead ∈ rl1, ¬ vs0[phead1].next ∈ rl, ¬ vs0[phead1].next ∈ qrl1, ¬ vs0[phead1].next ∈ qrl0, ¬ vs0[phead1].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ ps[first].next ∈ rl1, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, vs[(vs0[phead1].next ' + qrl1).last].next ≠ null → vs0[(vs0[phead1].next ' + qrl1).last].next = vs[(vs0[phead1].next ' + qrl1).last].next ∧ vs0[vs0[(vs0[phead1].next ' + qrl1).last].next].val = vs[vs0[(vs0[phead1].next ' + qrl1).last].next].val, vs0[phead1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[phead1].next].val), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ first ' + qrl0 + phead1 ' + vs0[phead1].next ' + qrl1 + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r = vs0[phead1].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ qrl1 ∨ ps[first].next ∈ qrl0, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 = vs0[phead1].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vhead ∈ qrl0 ∨ vhead = phead1, phead1 = vhead ∧ unmarkedp(qrl1, vs) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ vs[vs0[phead1].next].deqID = None ∧ unmarkedp(qrl1, vs), vtail0 = (vs0[phead1].next ' + qrl1 + rl).last ∨ vtail0 = (phead1 ' + ((vs0[phead1].next ' + qrl1) + rl).butlast).last ∧ vs0[((vs0[phead1].next ' + qrl1) + rl).last].deqID = None ∧ vs0[((vs0[phead1].next ' + qrl1) + rl).last].next = null, vtail = (vs0[phead1].next ' + qrl1).last ∨ vtail = (phead1 ' + (vs0[phead1].next ' + qrl1).butlast).last ∧ vs[(vs0[phead1].next ' + qrl1).last].deqID = None ∧ vs[(vs0[phead1].next ' + qrl1).last].next = null, lst ∈ qrl0 ∨ lst = phead1 ∨ lst = vs0[phead1].next ∨ lst ∈ qrl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next = vs0[phead1].next ∨ vs[first].next ∈ qrl1 ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ None ≠ Some(tid); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ some?(Some(tid)); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (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] ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s)

Proof step 193 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), phead1 ∈ (first ' from vhead) + qrl0 + phead1 ' + qrl + rl, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ first ', dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ vhead ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 194 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + phead1 ' = rl3 + phead1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, (first ' + qrl0).last = first, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ phead1, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl0, phead1, rl3 + phead1 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl0, phead1, rl3 + phead1 ' + rl4

Proof step 195 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 196 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = (rl3 + phead1 ' + rl4).butlast, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), (first ' + qrl0).last = first, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, phead1 = (rl3 + phead1 ' + rl4).last, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + phead1 ' + rl4 ≠ [], ps[first].next ≠ null, first ≠ lst, phead ≠ phead1, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, first, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 197 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = rl3 + (phead1 ' + rl4).butlast, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, (first ' + qrl0).last = first, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, phead1 = (phead1 ' + rl4).last, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ phead1, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [phead1 ', rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', rl4

Proof step 198 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 199 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = rl3 + (phead1 ' + rl4).butlast, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), (first ' + qrl0).last = first, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, phead1 = (phead1 ' + rl4).last, pretRefs(tid) = pretRefs0(tid), rl4 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ phead1, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + phead1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, first, vs, phead1, vs0), noid(tid, (rl3 + phead1 ' + rl4) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + phead1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, phead0 ∈ rl3 + phead1 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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 + [] = x; (s) ⊦ [] + x = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 200 from proof stable-D20 (previous step) (back to tree)

ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), (first ' + qrl0).last = first, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ phead1, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, first, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl0) + phead1 ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0) + phead1 ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: first ', qrl0

Proof step 201 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 202 from proof stable-D20 (previous step) (back to tree)

vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, (first ' + qrl0).last = first, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl0 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ phead1, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp(phead1 ' + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl0) + phead1 ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl0) + phead1 ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl0) + phead1 ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, lst ∈ qrl0 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (phead1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (phead1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, phead0 ∈ (rl1 + first ' + qrl0) + phead1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ x.head ∈ x ↔ x ≠ []; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (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) ⊦ markedp([], vs); (s) ⊦ a '.last = a; (s)

Proof step 203 from proof stable-D20 (previous step) (back to tree)

ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, first ≠ null, first ≠ lst, phead ≠ vs[first].next, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), (qrl + rl).head ≠ vs[first].next ∧ qrl + rl ≠ [] → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[first].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' + vs[first].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ (vs0[vs[first].next].next ≠ null → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

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

Proof step 204 from proof stable-D20 (previous step) (back to tree)

ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), qrl = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, first ≠ null, first ≠ lst, phead ≠ vs[first].next, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, (qrl + rl).head ≠ vs[first].next ∧ qrl + rl ≠ [] → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl, vtail0 = (vs[first].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[vs[first].next].next ≠ null → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ some?(Some(tid)); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (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) ⊦ unmarkedp([], vs); (s)

Proof step 205 from proof stable-D20 (previous step) (back to tree)

ps[vs[first].next].deqID = Some(tid), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = Some(tid), ps[vs[first].next].next = null, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps0[vs[first].next].val = vs0[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, vs[first].next ≠ first, first ≠ null, phead ≠ vs[first].next, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ', vs, ps, owns), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ', vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ', vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), unmarkedp(rl, ps0), vs[first].next ∈ ps, vs[first].next ∈ vs, pretRefs0(tid) ∈ vrvHp, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, rl ≠ [] → unmarkedp(rl.tail, vs0), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next ∧ vs0[vs0[vs[first].next].next].val = vs[vs0[vs[first].next].next].val, rl.head ≠ vs[first].next ∧ rl ≠ [] → vs0[rl.head].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ vs[first].next ∧ vs0[vs[first].next].next ∈ rl → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs[vs[first].next].next ∈ vs ∧ vs[vs[first].next].next ∈ ps ∧ ps[vs[vs[first].next].next] = vs[vs[vs[first].next].next] ∧ ps[vs[vs[first].next].next].deqID = None ∧ ps[vs[vs[first].next].next].next = null ∧ weak?(owns(vs[vs[first].next].next)), vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ∀ r. r ∈ rl1 ∨ r = vs[first].next → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ∈ rl → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' from phead ∨ phead0 ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ rl ≠ [] ∧ vtail0 = (vs[first].next ' + rl.butlast).last ∧ vs0[rl.last].deqID = None ∧ vs0[rl.last].next = null, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = vs[first].next ∨ vtail0 ∈ rl ⊦ (vs0[vs[first].next].next ≠ null → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid)) ∧ (rl = [] ∨ vs0[rl.head].deqID ≠ Some(tid))

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

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) ⊦ 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) ⊦ (a ' + x).tail = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ weak?(Some(tid)); (s) ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (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] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s)

Proof step 206 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + rl0.last ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], rl0.last ≠ first, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl0.last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, rl0.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), rl0.last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[rl0.last].next ≠ ps[first].next ∧ vs0[rl0.last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[rl0.last].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, rl0.last ∈ rl1 ∨ rl0.last ∈ rl2 ∨ rl0.last ∈ rl0 ⊦ (vs0[rl0.last].next ≠ null → vs0[vs0[rl0.last].next].deqID ≠ Some(tid)) ∧ (rl0.last ∈ rl2 ∨ rl0.last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 207 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + rl0.last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], rl0.last ≠ first, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + rl0.last ' + rl4) + qrl0, vs0, ps0, owns0), listp(rl0.last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, rl0.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + rl0.last ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + rl0.last ' + rl4) + qrl0 from vtail, rl0.last ∈ (rl3 + rl0.last ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[rl0.last].next ≠ ps[first].next ∧ vs0[rl0.last].next ∈ (rl3 + rl0.last ' + rl4) + qrl0 from ps[first].next → vs0[vs0[rl0.last].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + rl0.last ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + rl0.last ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[rl0.last].next ≠ null → vs0[vs0[rl0.last].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [rl0, vtail1, rl5]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y

Proof step 208 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vtail1 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = rl5 + vtail1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 209 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: first ', rl2

Proof step 210 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 211 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl5, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 212 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl5, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), lst ∈ ps, lst ∈ vs, lst ∈ qrl, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from first, dom prvHp ⊆ dom prvHp0, ¬ dups(rl5), ¬ dups(qrl0), ¬ dups(rl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs) ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

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, phead1, y

Proof step 213 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + qrl1, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl ≠ [], vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from first, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl5), ¬ dups(qrl0), ¬ dups(rl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (qrl ≠ [] → unmarkedp(qrl1, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (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); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s)

Proof step 214 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, (vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl5, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl1, vs), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from first, dom prvHp ⊆ dom prvHp0, ¬ dups(rl5), ¬ dups(qrl0), ¬ dups(rl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ first ∈ qrl1, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + rl5, vtail1, rl3 + vtail1 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + rl5, vtail1, rl3 + vtail1 ' + rl4

Proof step 215 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 216 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + rl5 = (rl3 + vtail1 ' + rl4).butlast, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (rl3 + vtail1 ' + rl4).last, rl3 + vtail1 ' + rl4 ≠ [], vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), markedp(rl5, vs0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl1, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from first, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl5), ¬ dups(qrl0), ¬ dups(rl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ first ∈ qrl1, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 217 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl5, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl1, vs), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from first, dom prvHp ⊆ dom prvHp0, ¬ dups(rl5), ¬ dups(qrl0), ¬ dups(rl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ first ∈ qrl1, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vtail1 ', rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vtail1 ', rl4

Proof step 218 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 219 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, (vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rl4 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), markedp(rl5, vs0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl1, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from first, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl5), ¬ dups(qrl0), ¬ dups(rl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ first ∈ qrl1, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 220 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(vs[first].next ' + qrl1, vs, ps, owns), markedp(rl5, vs0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs((rl1 + first ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl1, ps), vtail0 ∈ (rl1 + first ' + rl5) + vtail1 ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + rl5), ¬ dups(qrl0), ¬ dups(rl5), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl5, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl5

Additional information

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

Proof step 221 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rl5 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp((rl1 + first ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl5, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl1, vs), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + rl5) + vtail1 ' + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + rl5), ¬ dups(qrl0), ¬ dups(rl5), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl5, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ some?(Some(tid)); (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 ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ markedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 222 from proof stable-D20 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, vs[first].next ≠ first, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(vs[first].next ' + qrl1, vs, ps, owns), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl1, ps0), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl1 + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl), ¬ dups(qrl1 + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + rl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ first ∈ rl, ¬ first ∈ qrl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, qrl1 + rl ≠ [] → unmarkedp((qrl1 + rl).tail, vs0), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl1 ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), (qrl1 + rl).head ≠ vs[first].next ∧ qrl1 + rl ≠ [] → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, vtail0 = (vs[first].next ' + qrl1 + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, lst = vs[first].next ∨ lst ∈ qrl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ⊦ (vs0[vs[first].next].next ≠ null → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid)) ∧ (qrl1 + rl = [] ∨ vs0[(qrl1 + rl).head].deqID ≠ Some(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 223 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[vs[first].next].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vs[first].next].next ≠ null, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), unmarkedp(qrl1, ps0), unmarkedp(rl, ps0), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl), ¬ dups(qrl1 + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + rl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ first ∈ rl, ¬ first ∈ qrl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, (qrl1 + rl).head ≠ vs[first].next ∧ qrl1 + rl ≠ [] → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl1 ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl1 + rl ≠ [] → unmarkedp((qrl1 + rl).tail, vs0), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vs[first].next ' + qrl1 + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl ⊦

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 224 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[vs[first].next].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, first ≠ lst, first ≠ null, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), unmarkedp(qrl1, ps0), unmarkedp(rl, ps0), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl1), ¬ dups(rl1 + qrl1 + rl), ¬ dups(rl1), ¬ dups(qrl1 + rl), ¬ dups(rl), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ qrl1, ¬ first ∈ rl, ¬ vs[first].next ∈ rl, (qrl1 + rl).head ≠ vs[first].next ∧ qrl1 + rl ≠ [] → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl1 + rl ≠ [] → unmarkedp((qrl1 + rl).tail, vs0), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vs[first].next ' + qrl1 + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl1 ∨ vs0[vs[first].next].next ∈ rl)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl1

Additional information

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

Proof step 225 from proof stable-D20 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs0[vs0[vs[first].next].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), qrl1 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, first ≠ lst, first ≠ null, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(vs[first].next ' + qrl1, vs, ps, owns), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl1, ps0), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl1 + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl1), ¬ dups(rl1 + qrl1 + rl), ¬ dups(rl1), ¬ dups(qrl1 + rl), ¬ dups(rl), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ qrl1, ¬ first ∈ rl, ¬ vs[first].next ∈ rl, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, qrl1 + rl ≠ [] → unmarkedp((qrl1 + rl).tail, vs0), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, (qrl1 + rl).head ≠ vs[first].next ∧ qrl1 + rl ≠ [] → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, vtail0 = (vs[first].next ' + qrl1 + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, lst = vs[first].next ∨ lst ∈ qrl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl1 ∨ vs0[vs[first].next].next ∈ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (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) ⊦ unmarkedp([], vs); (s)

Proof step 226 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[vs[first].next].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].next = null, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, ps0[vs[first].next].val = vs0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = vs0[first].val, ps[vs[first].next].val = vs0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, first ≠ null, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ', vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs0, ps0, owns0), listp(vs[first].next ' + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ', vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ', vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(rl, ps0), pretRefs0(tid) ∈ vrvHp, vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs[first].next ∈ rl, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs[vs[first].next].next ≠ null → vs[vs[first].next].next ∈ vs ∧ vs[vs[first].next].next ∈ ps ∧ ps[vs[vs[first].next].next] = vs[vs[vs[first].next].next] ∧ ps[vs[vs[first].next].next].deqID = None ∧ ps[vs[vs[first].next].next].next = null ∧ weak?(owns(vs[vs[first].next].next)), rl.head ≠ vs[first].next ∧ rl ≠ [] → vs0[rl.head].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next ∧ vs0[vs0[vs[first].next].next].val = vs[vs0[vs[first].next].next].val, rl ≠ [] → unmarkedp(rl.tail, vs0), ∀ r0. r0 ∈ rl → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = (vs[first].next ' + rl).last ∨ rl ≠ [] ∧ vtail0 = (vs[first].next ' + rl.butlast).last ∧ vs0[rl.last].deqID = None ∧ vs0[rl.last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ rl, vtail0 = vs[first].next ∨ vtail0 ∈ rl ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ vs0[vs[first].next].next ∈ rl

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

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) ⊦ 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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x).head = a; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = 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] ⊦ some?(Some(tid)); (s) ⊦ ¬ weak?(Some(tid)); (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] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s)

Proof step 227 from proof stable-D20 (previous step) (back to tree)

vs0[(qrl1 + rl).head].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl1 + rl ≠ [], vs[first].next ≠ null, vs[first].next ≠ first, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), unmarkedp(qrl1, ps0), unmarkedp(rl, ps0), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl), ¬ dups(qrl1 + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + rl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ first ∈ rl, ¬ first ∈ qrl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, (qrl1 + rl).head ≠ vs[first].next ∧ qrl1 + rl ≠ [] → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl1 ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl1 + rl ≠ [] → unmarkedp((qrl1 + rl).tail, vs0), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vs[first].next ' + qrl1 + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs[first].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ 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] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 228 from proof stable-D20 (previous step) (back to tree)

vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, (qrl1 + rl).head = vs[first].next, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl1 + rl ≠ [], vs[first].next ≠ first, vs[first].next ≠ null, first ≠ lst, first ≠ null, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl1 + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp((qrl1 + rl).tail, vs0), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), unmarkedp(qrl1, ps0), unmarkedp(rl, ps0), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl1), ¬ dups(rl1 + qrl1 + rl), ¬ dups(rl1), ¬ dups(qrl1 + rl), ¬ dups(rl), ¬ dups(qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ qrl1, ¬ first ∈ rl, ¬ vs[first].next ∈ rl, vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl1 ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, vtail0 = (qrl1 + rl).last ∨ vtail0 = (vs[first].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl1 + rl, vtail1, rl0]

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl1 + rl, head, tail

Proof step 229 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl1) + rl = (rl5 + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rl5 = first0 + rl0, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp((rl1 + first ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl5, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl1, vs), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + rl5) + vtail1 ' + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + rl5), ¬ dups(qrl0), ¬ dups(rl5), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl5, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ vs[first].next ∧ vs0[vtail1].next ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl5 + vtail1 ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), lst = vs[first].next ∨ lst ∈ qrl1, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl5 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ some?(Some(tid)); (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 = a ' + x; (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 230 from proof stable-D20 (previous step) (back to tree)

qrl1 + rl = rl0 + vtail1 ' + qrl0, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ vs[first].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl1, vs, ps, owns), listp(vs[first].next ' + qrl1, vs, ps, owns), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl0) + vtail1 ' + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl0) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl1, ps), vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl0) + vtail1 ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(rl), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl1 + qrl1), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ first ∈ qrl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vs[first].next ' + qrl1).last].next ≠ null → vs0[(vs[first].next ' + qrl1).last].next = vs[(vs[first].next ' + qrl1).last].next ∧ vs0[vs0[(vs[first].next ' + qrl1).last].next].val = vs[vs0[(vs[first].next ' + qrl1).last].next].val, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs0[vtail1].next ≠ vs[first].next ∧ (vs0[vtail1].next ∈ rl0 ∨ vs0[vtail1].next = vtail1 ∨ vs0[vtail1].next ∈ qrl0) → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0.head ≠ vs[first].next ∧ ([].head ∈ rl0 ∨ [].head = vtail1 ∨ qrl0 ≠ []) → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ rl0 ∨ r0 = vtail1 ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl1).last ∨ vtail = (first ' + (vs[first].next ' + qrl1).butlast).last ∧ vs[(vs[first].next ' + qrl1).last].deqID = None ∧ vs[(vs[first].next ' + qrl1).last].next = null, lst = vs[first].next ∨ lst ∈ qrl1, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl0 ∨ phead0 = vtail1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

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) ⊦ 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 ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) 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] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 231 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl5, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 232 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Additional information

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

Proof step 233 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = qrl1 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl5, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 234 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail1 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl3 + vtail1 ' + rl4, qrl0, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl from r0 → r ∈ rl; (ss) Used terms: rl3 + vtail1 ' + rl4, qrl0, vhead

Proof step 235 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 236 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vtail1 ∈ (rl3 + vtail1 ' + rl4 from vhead) + qrl0, vhead ∈ rl3 + vtail1 ' + rl4, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 237 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vtail1 ∈ rl3 + vtail1 ' + rl4 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ rl3 ∨ vhead = vtail1 ∨ vhead ∈ rl4 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl3, vtail1 ' + rl4, vhead], <all paths>

Additional information

Used terms: rl3, vtail1 ' + rl4, vhead

Proof step 238 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 239 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail1 ∈ rl3 + vtail1 ' + rl4 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vhead ∈ rl3, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ rl3 ∨ vhead = vtail1 ∨ vhead ∈ rl4, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ∈ y ∧ ¬ b ∈ x → (x + a ' + z = y + b ' + y0 ↔ a = b ∧ x = y ∧ z = y0); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 240 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vtail1 ∈ vtail1 ' + rl4 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vhead ∈ rl3, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead = vtail1 ∨ vhead ∈ rl4, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl1 ∨ vhead = phead1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl1 + phead1 ' + rl5, vtail1, rl3 + vtail1 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl1 + phead1 ' + rl5, vtail1, rl3 + vtail1 ' + rl4

Proof step 241 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 242 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + phead1 ' + rl5 = (rl3 + vtail1 ' + rl4).butlast, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (rl3 + vtail1 ' + rl4).last, rl3 + vtail1 ' + rl4 ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail1 ∈ vtail1 ' + rl4 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vhead ∈ rl3, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ qrl1 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vhead = vtail1 ∨ vhead ∈ rl4 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 243 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vtail1 ∈ vtail1 ' + rl4 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vhead ∈ rl3, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead = vtail1 ∨ vhead ∈ rl4, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl1 ∨ vhead = phead1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vtail1 ', rl4], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) Used terms: vtail1 ', rl4

Proof step 244 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 245 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + vtail1 ' + rl4.butlast, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, rl4 ≠ [], vhead ≠ first, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail1 ∈ vtail1 ' + rl4 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vhead ∈ rl3, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ qrl1 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vhead = vtail1 ∨ vhead ∈ rl4 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ' + x).last = x.last; (s)

Proof step 246 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + rl4.last ' + rl4.butlast, qrl + rl = (rl5 + rl4.last ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, rl4.last ≠ phead1, rl4.last ≠ first, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, pretRefs0(tid) ≠ null, rl4 ≠ [], vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + rl4.last ' + rl4) + qrl0, vs0, ps0, owns0), listp(rl4.last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, rl4.last, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + rl4.last ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[rl4.last].deqID), some?(vs0[rl4.last].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), rl4.last ∈ rl4.last ' + rl4 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + rl4.last ' + rl4) + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ rl4.last ∈ qrl1, ¬ rl4.last ∈ qrl0, ¬ rl4.last ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ rl4.last ∈ rl5, ¬ vhead ∈ rl3, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[rl4.last].next ≠ null ∧ vs0[vs0[rl4.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl4.last].next].deqID.tid)) = Claimed(vs0[vs0[rl4.last].next].deqID.tid, vs0[vs0[rl4.last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[rl4.last].next ≠ ps[first].next ∧ vs0[rl4.last].next ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[vs0[rl4.last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ qrl1 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = rl4.last, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (rl4.last ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl4.last ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = rl4.last ∨ phead0 ∈ qrl0, vhead = rl4.last ∨ vhead ∈ rl4 ⊦ (vs0[rl4.last].next ≠ null → vs0[vs0[rl4.last].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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] → [rl4, vtail1, qrl2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl4, vtail1, y

Proof step 247 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + vtail1 ' + qrl2, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl4 = qrl2 + vtail1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, pretRefs0(tid) ≠ null, rl4 ≠ [], vhead ≠ first, vtail1 ≠ phead1, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vtail1 ∈ vtail1 ' + rl4 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vhead ∈ rl3, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead = vtail1 ∨ vhead ∈ rl4, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vhead ∈ qrl1 ∨ vhead = phead1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) ⊦ x + a ' ≠ []; (s)

Proof step 248 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + vtail1 ' + qrl2, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ phead1, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vtail1 ' + (qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail1 ∈ vtail1 ' + qrl2 + vtail1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vhead ∈ rl3, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ qrl1 ∨ vhead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vhead = vtail1 ∨ vhead ∈ qrl2 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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:[rl, vs, ps, owns] → [vtail1 ' + (qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0]

Additional information

Used simplifier rules: ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vtail1 ' + (qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0

Proof step 249 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 250 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail1 ∈ (rl3 from vhead) + vtail1 ' + rl4, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vhead ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vhead ∈ rl3 ∨ vhead = vtail1 ∨ vhead ∈ rl4, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 251 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl1).last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 135

Additional information

Proof step 252 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, phead1 = vhead, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vhead ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), qrl ≠ [] → unmarkedp(qrl.tail, vs), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 253 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + qrl1 + vhead ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vhead, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ vhead, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vhead ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl1 + vhead ' + rl5, vtail1, rl3 + vtail1 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl1 + vhead ' + rl5, vtail1, rl3 + vtail1 ' + rl4

Proof step 254 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 255 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + vhead ' + rl5 = (rl3 + vtail1 ' + rl4).butlast, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (rl3 + vtail1 ' + rl4).last, rl3 + vtail1 ' + rl4 ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vhead, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ vhead, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 256 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + vhead ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vhead, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ vhead, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vhead ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vtail1 ', rl4], <all paths>

Additional information

Used terms: vtail1 ', rl4

Proof step 257 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 258 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + vhead ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl4 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vhead, first ≠ lst, pretRefs0(tid) ≠ null, vtail1 ≠ vhead, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 = x; (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 259 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vhead, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 260 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl0 = vtail2 + qrl2, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vhead, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl1 + first ' + qrl1 + vhead ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 261 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl5 + vtail1 ' + vs0[vtail1].next ' + qrl2, vs0[vs0[vtail1].next].deqID = Some(tid), ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[vs0[vtail1].next].deqID = None, ps0[vtail1].deqID = vs0[vtail1].deqID, ps0[first].next = ps[first].next, ps0[vtail1].next = vs0[vtail1].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[vtail1].val = vs0[vtail1].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vtail1) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vhead, first ≠ vs0[vtail1].next, pretRefs0(tid) ≠ null, vhead ≠ vs0[vtail1].next, vtail1 ≠ first, vtail1 ≠ vhead, vtail1 ≠ null, vtail1 ≠ vs0[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), listp(vs0[vtail1].next ' + qrl2, vs0, ps0, owns0), listp(rl1 + first ' + qrl1 + vhead ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl1 + vhead ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl2, ps0), unmarkedp(qrl, ps), unmarkedp(qrl2, vs0), vtail0 ∈ rl1 + first ' + qrl1 + vhead ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, vtail1 ∈ vs0, vtail1 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1 + rl5) + qrl2), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups((qrl1 + rl5) + qrl2), ¬ dups(rl5), ¬ dups(qrl2), ¬ dups(qrl1), ¬ dups(rl5 + qrl2), ¬ dups(qrl1 + rl5), ¬ dups(rl1), ¬ dups(qrl1 + rl5 + qrl2), ¬ dups(rl1 + qrl1), ¬ dups(rl1 + qrl1 + rl5), ¬ weak?(vs0[vtail1].deqID), ¬ vtail1 ∈ qrl1, ¬ vs0[vtail1].next ∈ rl1, ¬ vs0[vtail1].next ∈ qrl1, ¬ vs0[vtail1].next ∈ rl5, ¬ vs0[vtail1].next ∈ qrl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl2, ¬ vhead ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl2, vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, vs0[vtail1].next ≠ null → rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vtail1].next].val), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl1 + vhead ' + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 = vs0[vtail1].next ∨ phead0 ∈ qrl2, vtail0 = (vs0[vtail1].next ' + qrl2).last ∨ vtail0 = (vtail1 ' + (vs0[vtail1].next ' + qrl2).butlast).last ∧ vs0[(vs0[vtail1].next ' + qrl2).last].deqID = None ∧ vs0[(vs0[vtail1].next ' + qrl2).last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ rl1 + first ' + qrl1 + vhead ' + qrl + rl from ps[first].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl1

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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ None ≠ Some(tid); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s)

Proof step 262 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + vhead ' + rl5 = rl3 + vtail1 ' + rl4.butlast, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vhead, first ≠ lst, pretRefs0(tid) ≠ null, rl4 ≠ [], vtail1 ≠ vhead, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ' + x).last = x.last; (s)

Proof step 263 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + vhead ' + rl5 = rl3 + rl4.last ' + rl4.butlast, qrl + rl = (rl5 + rl4.last ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, rl4.last ≠ first, rl4.last ≠ vhead, ps[first].next ≠ null, first ≠ lst, first ≠ vhead, pretRefs0(tid) ≠ null, rl4 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl4.last ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + rl4.last ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, rl4.last, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + rl4.last ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[rl4.last].deqID), some?(ps0[rl4.last].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead ∈ rl3, vtail0 ∈ (rl3 + rl4.last ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ rl4.last ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ rl4.last ∈ rl1, ¬ rl4.last ∈ qrl0, ¬ rl4.last ∈ qrl1, vs0[rl4.last].next ≠ ps[first].next ∧ vs0[rl4.last].next ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[vs0[rl4.last].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[rl4.last].next ≠ null ∧ vs0[vs0[rl4.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl4.last].next].deqID.tid)) = Claimed(vs0[vs0[rl4.last].next].deqID.tid, vs0[vs0[rl4.last].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = rl4.last ∨ phead0 ∈ qrl0, vtail0 = (rl4.last ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl4.last ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = rl4.last, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ (vs0[rl4.last].next ≠ null → vs0[vs0[rl4.last].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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] → [rl4, phead1, qrl2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl4, phead1, y

Proof step 264 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + phead1 ') + qrl0, rl1 + first ' + qrl1 + vhead ' + rl5 = rl3 + phead1 ' + qrl2, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl4 = qrl2 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vhead, phead1 ≠ first, phead1 ≠ vhead, pretRefs0(tid) ≠ null, rl4 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp((rl3 + phead1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(phead1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + phead1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + phead1 ' + rl4) + qrl0 from vtail, vhead ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ phead1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + phead1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ (rl3 + phead1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + phead1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = phead1, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, vtail0 = (phead1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = phead1 ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ' ≠ []; (s)

Proof step 265 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + vhead ' + rl5 = rl3 + phead1 ' + qrl2, qrl + rl = (rl5 + phead1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vhead, phead1 ≠ first, phead1 ≠ vhead, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(phead1 ' + (qrl2 + phead1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + phead1 ' + qrl2 + phead1 ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + vhead ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, phead1, vs0), noid(tid, (rl1 + first ' + qrl1 + vhead ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + phead1 ' + qrl2 + phead1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead ∈ rl3, vtail0 ∈ (rl3 + phead1 ' + qrl2 + phead1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + vhead ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ phead1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ rl5, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl1, vs0[phead1].next ≠ ps[first].next ∧ vs0[phead1].next ∈ (rl3 + phead1 ' + qrl2 + phead1 ') + qrl0 from ps[first].next → vs0[vs0[phead1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + phead1 ' + qrl2 + phead1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[phead1].next ≠ null ∧ vs0[vs0[phead1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead1].next].deqID.tid)) = Claimed(vs0[vs0[phead1].next].deqID.tid, vs0[vs0[phead1].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), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + phead1 ' + qrl2 + phead1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + vhead ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = phead1 ∨ phead0 ∈ qrl0, vtail0 = (phead1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = vhead ∨ phead0 ∈ rl5 ∨ phead0 = phead1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ (vs0[phead1].next ≠ null → vs0[vs0[phead1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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:[rl, vs, ps, owns] → [(rl3 + phead1 ' + qrl2 + phead1 ') + qrl0, vs0, ps0, owns0]

Additional information

Used simplifier rules: ⊦ dups(x + a ' + y + a ' + z); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (rl3 + phead1 ' + qrl2 + phead1 ') + qrl0, vs0, ps0, owns0

Proof step 266 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 267 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, (first ' + qrl1).last = vhead, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, vhead ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead1, vhead = first ∨ vhead ∈ qrl1 ∨ vhead = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 268 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + qrl1 + phead1 ') + rl5 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (first ' + qrl1).last ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, (first ' + qrl1).last ∈ vs0, (first ' + qrl1).last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl1 + phead1 ' + rl5, vtail1, rl3 + vtail1 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl1 + phead1 ' + rl5, vtail1, rl3 + vtail1 ' + rl4

Proof step 269 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 270 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + phead1 ' + rl5 = (rl3 + vtail1 ' + rl4).butlast, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (rl3 + vtail1 ' + rl4).last, rl3 + vtail1 ' + rl4 ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (first ' + qrl1).last ∈ ps0, (first ' + qrl1).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, (first ' + qrl1).last ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 271 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (first ' + qrl1).last ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, (first ' + qrl1).last ∈ vs0, (first ' + qrl1).last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vtail1 ', rl4], <all paths>

Additional information

Used terms: vtail1 ', rl4

Proof step 272 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 273 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + (vtail1 ' + rl4).butlast, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl4 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (first ' + qrl1).last ∈ ps0, (first ' + qrl1).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, (first ' + qrl1).last ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 274 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (first ' + qrl1).last ∈ ps0, (first ' + qrl1).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, (first ' + qrl1).last ∈ rl1 ∨ (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1 ∨ (first ' + qrl1).last ∈ rl5 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl1

Additional information

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

Proof step 275 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl1 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, (first ' + qrl1).last ∈ vs0, (first ' + qrl1).last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), (first ' + qrl1).last ∈ rl1 ∨ (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1 ∨ (first ' + qrl1).last ∈ rl5, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ some?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (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) ⊦ markedp([], vs); (s)

Proof step 276 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ lst, first ≠ null, phead ≠ vs[first].next, pretRefs0(tid) ≠ null, vtail1 ≠ vs[first].next, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vtail1, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl5 + qrl0), ¬ dups(rl1), ¬ dups(rl5), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl5, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl5, ¬ vs[first].next ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs0[vtail1].next ≠ vs[first].next ∧ (vs0[vtail1].next ∈ qrl ∨ vs0[vtail1].next ∈ rl) → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, lst = vs[first].next ∨ lst ∈ qrl, phead0 ∈ rl1 + first ' + vs[first].next ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

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) ⊦ 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 ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 277 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl1 = vtail2 + qrl2, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vtail0 ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, (first ' + qrl1).last ∈ vs0, (first ' + qrl1).last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl1 + first ' + qrl1 + phead1 ' + rl5) + vtail1 ' + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), (first ' + qrl1).last ∈ rl1 ∨ (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1 ∨ (first ' + qrl1).last ∈ rl5, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ some?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 278 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ phead1, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead ≠ phead1, phead1 ≠ vs[first].next, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ first, vtail1 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl + rl, vs0, ps0, owns0), listp(vtail1 ' + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl2 + phead1 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl, vs, ps, owns), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl2, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (vs[first].next ' + qrl2).last, vs, vtail1, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (vs[first].next ' + qrl2).last ∈ ps0, (vs[first].next ' + qrl2).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + qrl2 + qrl), ¬ dups(rl1 + qrl2 + rl5 + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + rl5 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl2 + rl5), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ dups(qrl2 + rl5), ¬ dups(rl5), ¬ weak?(vs[first].deqID), ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl5, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ vtail1 ∈ qrl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl2, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs0[vtail1].next ≠ vs[first].next ∧ (vs0[vtail1].next ∈ qrl2 ∨ vs0[vtail1].next = phead1 ∨ vs0[vtail1].next ∈ qrl ∨ vs0[vtail1].next ∈ rl) → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl2 ∨ qrl0.head = phead1 ∨ qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (vs[first].next ' + qrl2).last = first, vs[(vs[first].next ' + qrl2).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl2).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl2).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl2).last].next].val), (vs[first].next ' + qrl2).last ≠ first → nextnottid(tid, (vs[first].next ' + qrl2).last, vs), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl2 ∨ r0 = phead1 ∨ r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl2, lst = vs[first].next ∨ lst ∈ qrl2 ∨ lst = phead1 ∨ lst ∈ qrl, phead0 ∈ rl1 + first ' + (vs[first].next ' + qrl2) + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

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) ⊦ 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 ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 279 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + vtail1 ' + rl4.butlast, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = (vtail1 ' + rl4).last, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead ≠ phead1, pretRefs0(tid) ≠ null, rl4 ≠ [], vtail1 ≠ first, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (first ' + qrl1).last ∈ ps0, (first ' + qrl1).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, (first ' + qrl1).last ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl1) + rl5), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(rl5), ¬ dups(qrl1 + rl5), ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ first ∈ rl5, ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl1, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ' + x).last = x.last; (s)

Proof step 280 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + rl4.last ' + rl4.butlast, qrl + rl = (rl5 + rl4.last ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4.last ≠ phead1, rl4.last ≠ first, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead ≠ phead1, pretRefs0(tid) ≠ null, rl4 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + rl4.last ' + rl4) + qrl0, vs0, ps0, owns0), listp(rl4.last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, rl4.last, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + rl4.last ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[rl4.last].deqID), some?(vs0[rl4.last].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (first ' + qrl1).last ∈ ps0, (first ' + qrl1).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + rl4.last ' + rl4) + qrl0 from vtail, (first ' + qrl1).last ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ rl4.last ∈ qrl1, ¬ rl4.last ∈ qrl0, ¬ rl4.last ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ rl4.last ∈ rl5, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[rl4.last].next ≠ ps[first].next ∧ vs0[rl4.last].next ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[vs0[rl4.last].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs0[rl4.last].next ≠ null ∧ vs0[vs0[rl4.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl4.last].next].deqID.tid)) = Claimed(vs0[vs0[rl4.last].next].deqID.tid, vs0[vs0[rl4.last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + rl4.last ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = rl4.last, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (rl4.last ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl4.last ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = rl4.last ∨ phead0 ∈ qrl0 ⊦ (vs0[rl4.last].next ≠ null → vs0[vs0[rl4.last].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [rl4, vtail1, qrl2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl4, vtail1, y

Proof step 281 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + vtail1 ' + qrl2, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl4 = qrl2 + vtail1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead ≠ phead1, pretRefs0(tid) ≠ null, rl4 ≠ [], vtail1 ≠ phead1, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl5, vs0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(qrl1, vs), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (first ' + qrl1).last ∈ rl3, vtail0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, (first ' + qrl1).last ∈ vs0, (first ' + qrl1).last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ' ≠ []; (s)

Proof step 282 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl1 + phead1 ' + rl5 = rl3 + vtail1 ' + qrl2, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead ≠ phead1, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vtail1 ' + (qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(qrl1, vs0), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), markedp(qrl1, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), markedp(rl5, vs0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + qrl1).last, vs, vtail1, vs0), noid(tid, (rl1 + first ' + qrl1 + phead1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl1 + phead1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl, vs), (first ' + qrl1).last ∈ ps0, (first ' + qrl1).last ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl1 + phead1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from vtail, (first ' + qrl1).last ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1 + rl5), ¬ dups(rl5), ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(rl1 + qrl1 + rl5), ¬ dups(rl5 + qrl0), ¬ dups(qrl1 + rl5 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + qrl1) + qrl), ¬ dups((rl1 + qrl1) + rl5 + qrl0), ¬ dups((rl1 + qrl1) + rl5), ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ rl5, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl5, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, vs[(phead1 ' + qrl).last].next ≠ null → vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs0[(phead1 ' + qrl).last].next].val = vs[vs0[(phead1 ' + qrl).last].next].val, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vtail1].next ≠ ps[first].next ∧ vs0[vtail1].next ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vtail1].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + qrl1).last = first, ps[ps[first].next].deqID = None → (first ' + qrl1).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + qrl1).last].next ≠ null ∧ vs[vs[(first ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl1).last].next].deqID.tid, vs[vs[(first ' + qrl1).last].next].val), (first ' + qrl1).last ≠ first → nextnottid(tid, (first ' + qrl1).last, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl1 ∨ r = phead1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vtail1 ' + qrl2 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl1 ∨ ps[first].next = phead1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl1 ∨ vs[first].next = phead1 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl1 ∨ phead0 = phead1 ∨ phead0 ∈ rl5 ∨ phead0 = vtail1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + qrl1).last = first ∨ (first ' + qrl1).last ∈ qrl1 ∨ (first ' + qrl1).last = phead1, lst ∈ qrl1 ∨ lst = phead1 ∨ lst ∈ qrl, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' + qrl1 + phead1 ' from phead ∨ phead0 ∈ rl5 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ (vs0[vtail1].next ≠ null → vs0[vs0[vtail1].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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:[rl, vs, ps, owns] → [vtail1 ' + (qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0]

Additional information

Used simplifier rules: ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vtail1 ' + (qrl2 + vtail1 ') + qrl0, vs0, ps0, owns0

Proof step 283 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 284 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), (first ' + (rl2 + rl0).butlast).last = vhead0, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 285 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + (first ' + (rl2 + rl0).butlast).last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (first ' + (rl2 + rl0).butlast).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((first ' + (rl2 + rl0).butlast).last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (first ' + (rl2 + rl0).butlast).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, (first ' + (rl2 + rl0).butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs0[(first ' + (rl2 + rl0).butlast).last].next ≠ ps[first].next ∧ vs0[(first ' + (rl2 + rl0).butlast).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(first ' + (rl2 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + (rl2 + rl0).butlast).last ∈ rl1 ∨ (first ' + (rl2 + rl0).butlast).last ∈ rl2 ∨ (first ' + (rl2 + rl0).butlast).last ∈ rl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[(first ' + (rl2 + rl0).butlast).last].next ≠ null → vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID ≠ Some(tid)) ∧ ((first ' + (rl2 + rl0).butlast).last ∈ rl2 ∨ (first ' + (rl2 + rl0).butlast).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [rl2, rl0], <all paths>

Additional information

Used terms: rl2, rl0

Proof step 286 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 287 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + (first ' + (rl2 + rl0).butlast).last ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (first ' + (rl2 + rl0).butlast).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((first ' + (rl2 + rl0).butlast).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, (first ' + (rl2 + rl0).butlast).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (first ' + (rl2 + rl0).butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + (rl2 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[(first ' + (rl2 + rl0).butlast).last].next ≠ ps[first].next ∧ vs0[(first ' + (rl2 + rl0).butlast).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, (first ' + (rl2 + rl0).butlast).last ∈ rl1 ∨ (first ' + (rl2 + rl0).butlast).last ∈ rl2 ∨ (first ' + (rl2 + rl0).butlast).last ∈ rl0 ⊦ (vs0[(first ' + (rl2 + rl0).butlast).last].next ≠ null → vs0[vs0[(first ' + (rl2 + rl0).butlast).last].next].deqID ≠ Some(tid)) ∧ ((first ' + (rl2 + rl0).butlast).last ∈ rl2 ∨ (first ' + (rl2 + rl0).butlast).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 288 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + (first ' + rl2.butlast).last ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + rl2.butlast).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ rl2.last, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((first ' + rl2.butlast).last ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, (first ' + rl2.butlast).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), (first ' + rl2.butlast).last ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, vs0[(first ' + rl2.butlast).last].next ≠ null ∧ vs0[vs0[(first ' + rl2.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2.butlast).last].next].deqID.tid, vs0[vs0[(first ' + rl2.butlast).last].next].val), vs0[(first ' + rl2.butlast).last].next ≠ ps[first].next ∧ vs0[(first ' + rl2.butlast).last].next ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[vs0[(first ' + rl2.butlast).last].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2.butlast).last ∈ rl1 ∨ (first ' + rl2.butlast).last ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ (vs0[(first ' + rl2.butlast).last].next ≠ null → vs0[vs0[(first ' + rl2.butlast).last].next].deqID ≠ Some(tid)) ∧ (first ' + rl2.butlast).last ∈ rl2 ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic use patterns 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, vtail1, qrl0]

Additional information

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

Proof step 289 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + (first ' + qrl0).last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = qrl0 + vtail1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + qrl0).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), listp((first ' + qrl0).last ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (first ' + qrl0).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, (first ' + qrl0).last ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + qrl0).last].next ≠ ps[first].next ∧ vs0[(first ' + qrl0).last].next ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[vs0[(first ' + qrl0).last].next].deqID ≠ Some(tid), vs0[(first ' + qrl0).last].next ≠ null ∧ vs0[vs0[(first ' + qrl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl0).last].next].deqID.tid, vs0[vs0[(first ' + qrl0).last].next].val), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + qrl0).last ∈ rl1 ∨ (first ' + qrl0).last ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦ (vs0[(first ' + qrl0).last].next ≠ null → vs0[vs0[(first ' + qrl0).last].next].deqID ≠ Some(tid)) ∧ (first ' + qrl0).last ∈ rl2 ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 290 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + vtail1 ' = rl3 + (first ' + qrl0).last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + qrl0).last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((first ' + qrl0).last ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, (first ' + qrl0).last, vs0), noid(tid, (rl1 + first ' + qrl0 + vtail1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl0 + vtail1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vtail, (first ' + qrl0).last ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + qrl0).last].next ≠ ps[first].next ∧ vs0[(first ' + qrl0).last].next ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[vs0[(first ' + qrl0).last].next].deqID ≠ Some(tid), vs0[(first ' + qrl0).last].next ≠ null ∧ vs0[vs0[(first ' + qrl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl0).last].next].deqID.tid, vs0[vs0[(first ' + qrl0).last].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = vtail1, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = vtail1, lst ∈ qrl0 ∨ lst = vtail1 ∨ lst ∈ qrl, (first ' + qrl0).last ∈ rl1 ∨ (first ' + qrl0).last ∈ qrl0 ∨ (first ' + qrl0).last = vtail1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl1 + first ' + qrl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail1 ∈ rl3 ∨ vtail1 = (first ' + qrl0).last ∨ vtail1 ∈ rl4 ⊦ (vs0[(first ' + qrl0).last].next ≠ null → vs0[vs0[(first ' + qrl0).last].next].deqID ≠ Some(tid)) ∧ ((first ' + qrl0).last ∈ qrl0 ∨ (first ' + qrl0).last = vtail1) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', qrl0

Proof step 291 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 292 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + vtail1 ' = rl3 + qrl0.last ' + rl4, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl0.last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(qrl0.last ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, qrl0.last, vs0), noid(tid, (rl1 + first ' + qrl0 + vtail1 ') + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), qrl0.last ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + vtail1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups((rl1 + qrl0) + qrl), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[qrl0.last].next ≠ null ∧ vs0[vs0[qrl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl0.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl0.last].next].deqID.tid, vs0[vs0[qrl0.last].next].val), vs0[qrl0.last].next ≠ ps[first].next ∧ vs0[qrl0.last].next ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[vs0[qrl0.last].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail1 ∈ rl3 ∨ vtail1 = qrl0.last ∨ vtail1 ∈ rl4, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 + first ' + qrl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, qrl0.last ∈ rl1 ∨ qrl0.last ∈ qrl0 ∨ qrl0.last = vtail1, lst ∈ qrl0 ∨ lst = vtail1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = vtail1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl ⊦ (vs0[qrl0.last].next ≠ null → vs0[vs0[qrl0.last].next].deqID ≠ Some(tid)) ∧ (qrl0.last ∈ qrl0 ∨ qrl0.last = vtail1) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]

Proof step 293 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = rl3 + qrl0.last ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl0.last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail1 ≠ qrl0.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(qrl0.last ' + (qrl1 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + qrl0.last ' + qrl1 + vtail1 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, qrl0.last, vs0), noid(tid, (rl3 + qrl0.last ' + qrl1 + vtail1 ') + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + qrl0.last ' + qrl1 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), qrl0.last ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + qrl0.last ' + qrl1 + vtail1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[qrl0.last].next ≠ null ∧ vs0[vs0[qrl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl0.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl0.last].next].deqID.tid, vs0[vs0[qrl0.last].next].val), vs0[qrl0.last].next ≠ ps[first].next ∧ vs0[qrl0.last].next ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[vs0[qrl0.last].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + qrl0.last ' + qrl1 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, lst ∈ qrl0 ∨ lst = vtail1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = vtail1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = vtail1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl ⊦ (vs0[qrl0.last].next ≠ null → vs0[vs0[qrl0.last].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [qrl0, vhead0, qrl2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vhead0, y

Proof step 294 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 = rl3 + vhead0 ' + qrl1, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl0 = qrl2 + vhead0 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl0 ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl, vs, ps, owns), listp(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = vtail1, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = vtail1, lst ∈ qrl0 ∨ lst = vtail1 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + vhead0 ' + qrl1 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs) ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 295 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl2 + vhead ' = rl3 + vhead ' + qrl1, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps[vhead].next = ps0[vhead].next, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ ps0[vhead].next, first ≠ lst, phead ≠ ps0[vhead].next, phead0 ≠ ps0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl, vs, ps, owns), listp((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp(vhead ' + (qrl1 + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), markedp(qrl2, ps0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead].deqID), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[ps0[vhead].next].deqID), some?(vs0[ps0[vhead].next].deqID), some?(ps[ps0[vhead].next].deqID), some?(vs[ps0[vhead].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ ps0[vhead].next ∈ rl, ¬ ps0[vhead].next ∈ qrl, ¬ ps0[vhead].next ∈ qrl2, ¬ ps0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(ps0[vhead].next ' + qrl).last].next ≠ null → vs0[(ps0[vhead].next ' + qrl).last].next = vs[(ps0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(ps0[vhead].next ' + qrl).last].next].val = vs[vs0[(ps0[vhead].next ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = ps0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead, vtail = (ps0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (ps0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + vhead ' + qrl1 + ps0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = ps0[vhead].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = ps0[vhead].next ∨ vs[first].next ∈ qrl, lst ∈ qrl2 ∨ lst = vhead ∨ lst = ps0[vhead].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead ⊦ (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl2, vhead, rl3 + vhead ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl2, vhead, rl3 + vhead ' + qrl1

Proof step 296 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 297 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl2 = (rl3 + vhead ' + qrl1).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[vhead].next = ps0[vhead].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead = (rl3 + vhead ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + vhead ' + qrl1 ≠ [], ps[ps[first].next].deqID ≠ None, ps0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ ps0[vhead].next, first ≠ lst, phead ≠ ps0[vhead].next, phead0 ≠ ps0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead ' + (qrl1 + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, ps, owns), listp(first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), markedp(qrl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps0[vhead].next].deqID), some?(ps[ps0[vhead].next].deqID), some?(vs0[ps0[vhead].next].deqID), some?(ps0[ps0[vhead].next].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), some?(ps0[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ ps0[vhead].next ∈ rl, ¬ ps0[vhead].next ∈ qrl, ¬ ps0[vhead].next ∈ qrl2, ¬ ps0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs[(ps0[vhead].next ' + qrl).last].next ≠ null → vs0[(ps0[vhead].next ' + qrl).last].next = vs[(ps0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(ps0[vhead].next ' + qrl).last].next].val = vs[vs0[(ps0[vhead].next ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = ps0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, lst ∈ qrl2 ∨ lst = vhead ∨ lst = ps0[vhead].next ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = ps0[vhead].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = ps0[vhead].next ∨ ps[first].next ∈ qrl, phead0 ∈ rl3 + vhead ' + qrl1 + ps0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (ps0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (ps0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 298 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl2 = rl3 + (vhead ' + qrl1).butlast, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps[vhead].next = ps0[vhead].next, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead = (vhead ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ ps0[vhead].next, first ≠ lst, phead ≠ ps0[vhead].next, phead0 ≠ ps0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl, vs, ps, owns), listp((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp(vhead ' + (qrl1 + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), markedp(qrl2, ps0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead].deqID), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[ps0[vhead].next].deqID), some?(vs0[ps0[vhead].next].deqID), some?(ps[ps0[vhead].next].deqID), some?(vs[ps0[vhead].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ ps0[vhead].next ∈ rl, ¬ ps0[vhead].next ∈ qrl, ¬ ps0[vhead].next ∈ qrl2, ¬ ps0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(ps0[vhead].next ' + qrl).last].next ≠ null → vs0[(ps0[vhead].next ' + qrl).last].next = vs[(ps0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(ps0[vhead].next ' + qrl).last].next].val = vs[vs0[(ps0[vhead].next ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = ps0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead, vtail = (ps0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (ps0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl3 + vhead ' + qrl1 + ps0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = ps0[vhead].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = ps0[vhead].next ∨ vs[first].next ∈ qrl, lst ∈ qrl2 ∨ lst = vhead ∨ lst = ps0[vhead].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead ⊦ (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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] → [vhead ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead ', qrl1

Proof step 299 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 300 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl2 = rl3 + (vhead ' + qrl1).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[vhead].next = ps0[vhead].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl1 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead = (vhead ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ ps0[vhead].next, first ≠ lst, phead ≠ ps0[vhead].next, phead0 ≠ ps0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead ' + (qrl1 + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, ps, owns), listp(first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), markedp(qrl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps0[vhead].next].deqID), some?(ps[ps0[vhead].next].deqID), some?(vs0[ps0[vhead].next].deqID), some?(ps0[ps0[vhead].next].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), some?(ps0[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead ' + qrl1 + ps0[vhead].next ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ ps0[vhead].next ∈ rl, ¬ ps0[vhead].next ∈ qrl, ¬ ps0[vhead].next ∈ qrl2, ¬ ps0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs[(ps0[vhead].next ' + qrl).last].next ≠ null → vs0[(ps0[vhead].next ' + qrl).last].next = vs[(ps0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(ps0[vhead].next ' + qrl).last].next].val = vs[vs0[(ps0[vhead].next ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = ps0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + ps0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, lst ∈ qrl2 ∨ lst = vhead ∨ lst = ps0[vhead].next ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = ps0[vhead].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = ps0[vhead].next ∨ ps[first].next ∈ qrl, phead0 ∈ rl3 + vhead ' + qrl1 + ps0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vtail0 = (ps0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (ps0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ [] + x = 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) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 301 from proof stable-D20 (previous step) (back to tree)

ps0[vhead].deqID = vs0[vhead].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps[vhead].next = vs0[vhead].next, ps0[vhead].val = vs0[vhead].val, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs0[vhead].next ≠ vhead, first ≠ lst, first ≠ vs0[vhead].next, phead ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), markedp(qrl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vs0[vhead].next].deqID), some?(ps[vs0[vhead].next].deqID), some?(vs0[vs0[vhead].next].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vhead ∈ ps0, vhead ∈ vs0, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl + rl), ¬ dups((rl1 + qrl2) + qrl), ¬ dups(qrl2), ¬ dups(qrl + rl), ¬ dups(qrl2 + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2 + qrl), ¬ weak?(vs0[vhead].deqID), ¬ vhead ∈ rl1, ¬ vhead ∈ qrl2, ¬ vhead ∈ qrl, ¬ vhead ∈ rl, ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl2, ¬ vs0[vhead].next ∈ qrl, ¬ vs0[vhead].next ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl2, vs[(vs0[vhead].next ' + qrl).last].next ≠ null → vs0[(vs0[vhead].next ' + qrl).last].next = vs[(vs0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vhead].next ' + qrl).last].next].val = vs[vs0[(vs0[vhead].next ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, vs0[vhead].next ≠ null → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = vs0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, lst ∈ qrl2 ∨ lst = vhead ∨ lst = vs0[vhead].next ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = vs0[vhead].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = vs0[vhead].next ∨ ps[first].next ∈ qrl, vtail0 = (vs0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vs0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs0[vs0[vhead].next].deqID, tid0]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs0[vhead].next].deqID, tid0

Proof step 302 from proof stable-D20 (previous step) (back to tree)

vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[vhead].deqID = vs0[vhead].deqID, vs0[vs0[vhead].next].deqID = Some(tid0), ps[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps0[vhead].next = vs0[vhead].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, ps0[vhead].val = vs0[vhead].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs0[vhead].next ≠ vhead, first ≠ lst, first ≠ vs0[vhead].next, phead ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp(vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), markedp(qrl2, ps0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs0[vs0[vhead].next].deqID), some?(ps[vs0[vhead].next].deqID), some?(vs[vs0[vhead].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from vtail, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl + rl), ¬ dups((rl1 + qrl2) + qrl), ¬ dups(qrl2), ¬ dups(qrl + rl), ¬ dups(qrl2 + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2 + qrl), ¬ weak?(vs0[vhead].deqID), ¬ vhead ∈ rl1, ¬ vhead ∈ qrl2, ¬ vhead ∈ qrl, ¬ vhead ∈ rl, ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl2, ¬ vs0[vhead].next ∈ qrl, ¬ vs0[vhead].next ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl2, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(vs0[vhead].next ' + qrl).last].next ≠ null → vs0[(vs0[vhead].next ' + qrl).last].next = vs[(vs0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vhead].next ' + qrl).last].next].val = vs[vs0[(vs0[vhead].next ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = vs0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead, vtail = (vs0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = vs0[vhead].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = vs0[vhead].next ∨ vs[first].next ∈ qrl, lst ∈ qrl2 ∨ lst = vhead ∨ lst = vs0[vhead].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, phead0 ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ some?(Some(tid)); (s)

Proof step 303 from proof stable-D20 (previous step) (back to tree)

vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[vhead].deqID = vs0[vhead].deqID, vs0[vs0[vhead].next].deqID = Some(tid0), ps[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps0[vhead].next = vs0[vhead].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, ps0[vhead].val = vs0[vhead].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp(vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), markedp(qrl2, ps0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vs0[vhead].next].deqID), some?(ps[vs0[vhead].next].deqID), some?(vs[vs0[vhead].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from vtail, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ vs0[vhead].next ∈ rl, ¬ vs0[vhead].next ∈ qrl, ¬ vs0[vhead].next ∈ qrl2, ¬ vs0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[(vs0[vhead].next ' + qrl).last].next ≠ null → vs0[(vs0[vhead].next ' + qrl).last].next = vs[(vs0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vhead].next ' + qrl).last].next].val = vs[vs0[(vs0[vhead].next ' + qrl).last].next].val, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → tid0 ≠ tid, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = vs0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead, vtail = (vs0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = vs0[vhead].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = vs0[vhead].next ∨ vs[first].next ∈ qrl, lst ∈ qrl2 ∨ lst = vhead ∨ lst = vs0[vhead].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, phead0 ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → tid0 ≠ tid) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl2

Additional information

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

Proof step 304 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[vhead].next].deqID = Some(tid0), ps0[vhead].deqID = vs0[vhead].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps[vhead].next = vs0[vhead].next, ps0[vhead].val = vs0[vhead].val, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), qrl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, vhead ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), markedp(qrl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vs0[vhead].next].deqID), some?(ps[vs0[vhead].next].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vhead ∈ ps0, vhead ∈ vs0, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ vs0[vhead].next ∈ rl, ¬ vs0[vhead].next ∈ qrl, ¬ vs0[vhead].next ∈ qrl2, ¬ vs0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → tid0 ≠ tid, vs[(vs0[vhead].next ' + qrl).last].next ≠ null → vs0[(vs0[vhead].next ' + qrl).last].next = vs[(vs0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vhead].next ' + qrl).last].next].val = vs[vs0[(vs0[vhead].next ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = vs0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, lst ∈ qrl2 ∨ lst = vhead ∨ lst = vs0[vhead].next ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = vs0[vhead].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = vs0[vhead].next ∨ ps[first].next ∈ qrl, vtail0 = (vs0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vs0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead ⊦ (vs0[vhead].next ≠ null → tid0 ≠ tid) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ weak?(Some(tid)); (s) ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = 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) ⊦ markedp([], vs); (s)

Proof step 305 from proof stable-D20 (previous step) (back to tree)

vs0[vs[first].next].deqID = Some(tid), ps[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, vs0[vs0[vs[first].next].next].deqID = Some(tid0), ps0[vs[first].next].deqID = Some(tid), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), (qrl + rl).head = vs[first].next, ps[vs[first].next].next = vs0[vs[first].next].next, ps[first].next = vs[first].next, ps0[vs[first].next].next = vs0[vs[first].next].next, ps0[first].next = vs[first].next, vs[vs[first].next].next = vs0[vs[first].next].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps0[vs[first].next].val = vs0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, owns0(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], vs[first].next ≠ null, vs[first].next ≠ first, vs0[vs[first].next].next ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vs0[vs[first].next].next, phead ≠ vs0[vs[first].next].next, phead0 ≠ vs0[vs[first].next].next, pretRefs0(tid) ≠ null, tid0 ≠ tid, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl, vs, ps, owns), listp(vs0[vs[first].next].next ' + qrl, vs, ps, owns), listp(vs0[vs[first].next].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), nextnottid(tid, vs[first].next, vs), nextnottidRely(tid, vs[first].next, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(vs[vs0[vs[first].next].next].deqID), some?(ps[vs0[vs[first].next].next].deqID), some?(ps0[vs0[vs[first].next].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vs[first].next ∈ ps, vs[first].next ∈ vs, vs[first].next ∈ ps0, vs[first].next ∈ vs0, vtail0 ∈ rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(qrl + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl + rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs0[vs[first].next].next ∈ rl1, ¬ vs0[vs[first].next].next ∈ qrl, ¬ vs0[vs[first].next].next ∈ rl, ¬ first ∈ qrl, vs0[vs[first].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vs[first].next].next].val), vs[(vs0[vs[first].next].next ' + qrl).last].next ≠ null → vs0[(vs0[vs[first].next].next ' + qrl).last].next = vs[(vs0[vs[first].next].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vs[first].next].next ' + qrl).last].next].val = vs[vs0[(vs0[vs[first].next].next ' + qrl).last].next].val, vs0[vs[first].next].next ≠ null → rvowns(vretRefs(vs[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs[vs0[vs[first].next].next].deqID.tid, vs[vs0[vs[first].next].next].val), ∀ r0. r0 ≠ vs[first].next ∧ (r0 = vs0[vs[first].next].next ∨ r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs0[vs[first].next].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs0[vs[first].next].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vs[first].next].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (qrl + rl).last ∨ vtail0 = (vs0[vs[first].next].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl1 + first ' + vs[first].next ' + vs0[vs[first].next].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst = vs0[vs[first].next].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl + rl, vtail1, rl0]

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl + rl, head, tail

Proof step 306 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[vhead].next].deqID = Some(tid0), ps0[vhead].deqID = vs0[vhead].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps[vhead].next = vs0[vhead].next, ps0[vhead].val = vs0[vhead].val, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), qrl2 = first0 + qrl0, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, vhead ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), markedp(qrl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vs0[vhead].next].deqID), some?(ps[vs0[vhead].next].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vhead ∈ ps0, vhead ∈ vs0, vtail0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + qrl), ¬ dups(qrl2 + qrl + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl2), ¬ dups((rl1 + qrl2) + qrl), ¬ dups((rl1 + qrl2) + qrl + rl), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ qrl2, ¬ first ∈ qrl, ¬ vs0[vhead].next ∈ rl, ¬ vs0[vhead].next ∈ qrl, ¬ vs0[vhead].next ∈ qrl2, ¬ vs0[vhead].next ∈ rl1, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vhead ∈ rl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl2, ¬ vhead ∈ rl1, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → tid0 ≠ tid, vs[(vs0[vhead].next ' + qrl).last].next ≠ null → vs0[(vs0[vhead].next ' + qrl).last].next = vs[(vs0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vhead].next ' + qrl).last].next].val = vs[vs0[(vs0[vhead].next ' + qrl).last].next].val, (qrl + rl).head ≠ ps[first].next ∧ (qrl + rl).head ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[(qrl + rl).head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = vhead ∨ r = vs0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + vhead ') + vs0[vhead].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl2) + vhead ' + vs0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = vhead, lst ∈ qrl2 ∨ lst = vhead ∨ lst = vs0[vhead].next ∨ lst ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = vhead ∨ vs[first].next = vs0[vhead].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = vhead ∨ ps[first].next = vs0[vhead].next ∨ ps[first].next ∈ qrl, vtail0 = (vs0[vhead].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vs0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vs0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = vhead ⊦ (vs0[vhead].next ≠ null → tid0 ≠ tid) ∧ (qrl + rl = [] ∨ vs0[(qrl + rl).head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier 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] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ x.head ∈ x ↔ x ≠ []; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 307 from proof stable-D20 (previous step) (back to tree)

vs0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, vs0[vs0[vhead].next].deqID = Some(tid0), ps0[vhead].deqID = vs0[vhead].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), (qrl + rl).head = vs[first].next, ps[first].next = vs[first].next, ps0[vhead].next = vs0[vhead].next, ps0[first].next = vs[first].next, ps[vhead].next = vs0[vhead].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps0[vhead].val = vs0[vhead].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], ps[vs[first].next].deqID ≠ None, vs0[vhead].next ≠ vs[first].next, vs[first].next ≠ null, vs0[vhead].next ≠ vhead, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vs0[vhead].next, phead ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, tid0 ≠ tid, vhead ≠ vs[first].next, vhead ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl0 + vhead ' + vs0[vhead].next ' + qrl, vs, ps, owns), listp(vs0[vhead].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(vs[vs0[vhead].next].deqID), some?(ps[vs0[vhead].next].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vhead ∈ ps0, vhead ∈ vs0, vtail0 ∈ rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0 + qrl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1), ¬ dups(rl1 + qrl0 + qrl + rl), ¬ weak?(vs0[vhead].deqID), ¬ weak?(vs[first].deqID), ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ vhead ∈ rl, ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ qrl, ¬ vs0[vhead].next ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vhead ∈ 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[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), vs[(vs0[vhead].next ' + qrl).last].next ≠ null → vs0[(vs0[vhead].next ' + qrl).last].next = vs[(vs0[vhead].next ' + qrl).last].next ∧ vs0[vs0[(vs0[vhead].next ' + qrl).last].next].val = vs[vs0[(vs0[vhead].next ' + qrl).last].next].val, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl0 ∨ r0 = vhead ∨ r0 = vs0[vhead].next ∨ r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl0 ∨ r = vhead ∨ r = vs0[vhead].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs0[vhead].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs0[vhead].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl0 ∨ phead = vhead, vtail0 = (qrl + rl).last ∨ vtail0 = (vs0[vhead].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl1 + first ' + (vs[first].next ' + qrl0) + vhead ' + vs0[vhead].next ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, lst = vs[first].next ∨ lst ∈ qrl0 ∨ lst = vhead ∨ lst = vs0[vhead].next ∨ lst ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl + rl, vtail1, rl0]

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl + rl, head, tail

Proof step 308 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + (first ' + rl2 + rl0.butlast).last ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (first ' + rl2 + rl0.butlast).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((first ' + rl2 + rl0.butlast).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, (first ' + rl2 + rl0.butlast).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (first ' + rl2 + rl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + rl2 + rl0.butlast).last].next ≠ null ∧ vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID.tid, vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[(first ' + rl2 + rl0.butlast).last].next ≠ ps[first].next ∧ vs0[(first ' + rl2 + rl0.butlast).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, (first ' + rl2 + rl0.butlast).last ∈ rl1 ∨ (first ' + rl2 + rl0.butlast).last ∈ rl2 ∨ (first ' + rl2 + rl0.butlast).last ∈ rl0 ⊦ (vs0[(first ' + rl2 + rl0.butlast).last].next ≠ null → vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID ≠ Some(tid)) ∧ ((first ' + rl2 + rl0.butlast).last ∈ rl2 ∨ (first ' + rl2 + rl0.butlast).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 309 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + (first ' + rl2 + rl0.butlast).last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (first ' + rl2 + rl0.butlast).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ rl0.last, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((first ' + rl2 + rl0.butlast).last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (first ' + rl2 + rl0.butlast).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, (first ' + rl2 + rl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs0[(first ' + rl2 + rl0.butlast).last].next ≠ ps[first].next ∧ vs0[(first ' + rl2 + rl0.butlast).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(first ' + rl2 + rl0.butlast).last].next ≠ null ∧ vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID.tid, vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + rl2 + rl0.butlast).last ∈ rl1 ∨ (first ' + rl2 + rl0.butlast).last ∈ rl2 ∨ (first ' + rl2 + rl0.butlast).last ∈ rl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[(first ' + rl2 + rl0.butlast).last].next ≠ null → vs0[vs0[(first ' + rl2 + rl0.butlast).last].next].deqID ≠ Some(tid)) ∧ ((first ' + rl2 + rl0.butlast).last ∈ rl2 ∨ (first ' + rl2 + rl0.butlast).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [rl0, vtail1, rl5]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y

Proof step 310 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + (first ' + rl2 + rl5).last ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = rl5 + vtail1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (first ' + rl2 + rl5).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((first ' + rl2 + rl5).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, (first ' + rl2 + rl5).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (first ' + rl2 + rl5).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + rl2 + rl5).last].next ≠ null ∧ vs0[vs0[(first ' + rl2 + rl5).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2 + rl5).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2 + rl5).last].next].deqID.tid, vs0[vs0[(first ' + rl2 + rl5).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[(first ' + rl2 + rl5).last].next ≠ ps[first].next ∧ vs0[(first ' + rl2 + rl5).last].next ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[vs0[(first ' + rl2 + rl5).last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, (first ' + rl2 + rl5).last ∈ rl1 ∨ (first ' + rl2 + rl5).last ∈ rl2 ∨ (first ' + rl2 + rl5).last ∈ rl0 ⊦ (vs0[(first ' + rl2 + rl5).last].next ≠ null → vs0[vs0[(first ' + rl2 + rl5).last].next].deqID ≠ Some(tid)) ∧ ((first ' + rl2 + rl5).last ∈ rl2 ∨ (first ' + rl2 + rl5).last ∈ rl0) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 311 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + (first ' + rl2 + rl5).last ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + rl2 + rl5).last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((first ' + rl2 + rl5).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, (first ' + rl2 + rl5).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (first ' + rl2 + rl5).last ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + rl2 + rl5).last].next ≠ null ∧ vs0[vs0[(first ' + rl2 + rl5).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2 + rl5).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2 + rl5).last].next].deqID.tid, vs0[vs0[(first ' + rl2 + rl5).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[(first ' + rl2 + rl5).last].next ≠ ps[first].next ∧ vs0[(first ' + rl2 + rl5).last].next ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[(first ' + rl2 + rl5).last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 ∈ qrl0, (first ' + rl2 + rl5).last ∈ rl1 ∨ (first ' + rl2 + rl5).last ∈ rl2 ∨ (first ' + rl2 + rl5).last ∈ rl5 ∨ (first ' + rl2 + rl5).last = vtail1, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail1 ∈ rl3 ∨ vtail1 = (first ' + rl2 + rl5).last ∨ vtail1 ∈ rl4 ⊦ (vs0[(first ' + rl2 + rl5).last].next ≠ null → vs0[vs0[(first ' + rl2 + rl5).last].next].deqID ≠ Some(tid)) ∧ ((first ' + rl2 + rl5).last ∈ rl2 ∨ (first ' + rl2 + rl5).last ∈ rl5 ∨ (first ' + rl2 + rl5).last = vtail1) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first ', rl2 + rl5], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', rl2 + rl5

Proof step 312 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 313 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, (rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + (rl2 + rl5).last ' + rl4, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl5 ≠ [], (rl2 + rl5).last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl2 + rl5).last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl5, vs0), nextnottidRely(tid, vhead, vs, (rl2 + rl5).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vtail, (rl2 + rl5).last ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, vs0[(rl2 + rl5).last].next ≠ ps[first].next ∧ vs0[(rl2 + rl5).last].next ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[(rl2 + rl5).last].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(rl2 + rl5).last].next ≠ null ∧ vs0[vs0[(rl2 + rl5).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl5).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl5).last].next].deqID.tid, vs0[vs0[(rl2 + rl5).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail1 ∈ rl3 ∨ vtail1 = (rl2 + rl5).last ∨ vtail1 ∈ rl4, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), (rl2 + rl5).last ∈ rl1 ∨ (rl2 + rl5).last ∈ rl2 ∨ (rl2 + rl5).last ∈ rl5 ∨ (rl2 + rl5).last = vtail1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[(rl2 + rl5).last].next ≠ null → vs0[vs0[(rl2 + rl5).last].next].deqID ≠ Some(tid)) ∧ ((rl2 + rl5).last ∈ rl2 ∨ (rl2 + rl5).last ∈ rl5 ∨ (rl2 + rl5).last = vtail1) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl5], <all paths>

Additional information

Used terms: rl2, rl5

Proof step 314 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 315 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + (rl2 + rl5).last ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl5 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl5 ≠ [], (rl2 + rl5).last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl2 + rl5).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, (rl2 + rl5).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (rl2 + rl5).last ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(rl2 + rl5).last].next ≠ null ∧ vs0[vs0[(rl2 + rl5).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl5).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl5).last].next].deqID.tid, vs0[vs0[(rl2 + rl5).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[(rl2 + rl5).last].next ≠ ps[first].next ∧ vs0[(rl2 + rl5).last].next ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[(rl2 + rl5).last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 ∈ qrl0, (rl2 + rl5).last ∈ rl1 ∨ (rl2 + rl5).last ∈ rl2 ∨ (rl2 + rl5).last ∈ rl5 ∨ (rl2 + rl5).last = vtail1, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail1 ∈ rl3 ∨ vtail1 = (rl2 + rl5).last ∨ vtail1 ∈ rl4 ⊦ (vs0[(rl2 + rl5).last].next ≠ null → vs0[vs0[(rl2 + rl5).last].next].deqID ≠ Some(tid)) ∧ ((rl2 + rl5).last ∈ rl2 ∨ (rl2 + rl5).last ∈ rl5 ∨ (rl2 + rl5).last = vtail1) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] 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 + [] = x; (s) ⊦ [] + x = x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ ¬ a ∈ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 316 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl2 = rl3 + rl2.last ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2.last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl2 ≠ [], vtail1 ≠ rl2.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl2.last ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, rl2.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), rl2.last ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, vs0[rl2.last].next ≠ null ∧ vs0[vs0[rl2.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl2.last].next].deqID.tid)) = Claimed(vs0[vs0[rl2.last].next].deqID.tid, vs0[vs0[rl2.last].next].val), vs0[rl2.last].next ≠ ps[first].next ∧ vs0[rl2.last].next ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[vs0[rl2.last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl0, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[rl2.last].next ≠ null → vs0[vs0[rl2.last].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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, vhead0, rl0]

Additional information

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

Proof step 317 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + vhead0 ' + qrl1, qrl + rl = vtail1 ' + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = rl0 + vhead0 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps0), markedp(rl2, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + rl2 + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail1 ∈ qrl ∨ vtail1 ∈ rl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 318 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, qrl + rl = vtail1 ' + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead0, vhead = first ∨ vhead ∈ rl0 ∨ vhead = vhead0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 129

Additional information

Proof step 319 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead0 = vhead, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl0 ∨ vhead = vhead0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

Proof step 320 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 + vhead ' = rl3 + vhead ' + qrl1, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl0) + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl1), ¬ dups(rl0 + qrl), ¬ dups(rl1 + rl0), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ vhead ∈ rl0, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + rl0, vhead, rl3 + vhead ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + rl0, vhead, rl3 + vhead ' + qrl1

Proof step 321 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 322 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 = (rl3 + vhead ' + qrl1).butlast, qrl + rl = vtail1 ' + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead = (rl3 + vhead ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + vhead ' + qrl1 ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), listp((rl3 + vhead ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp(vhead ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl0) + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl1), ¬ dups(rl0 + qrl), ¬ dups(rl1 + rl0), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ vhead ∈ rl0, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead0 ∈ rl3 + vhead ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 323 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 = rl3 + (vhead ' + qrl1).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead = (vhead ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl0) + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl1), ¬ dups(rl0 + qrl), ¬ dups(rl1 + rl0), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ vhead ∈ rl0, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vhead ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead ', qrl1

Proof step 324 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 325 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 = rl3 + (vhead ' + qrl1).butlast, qrl + rl = vtail1 ' + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl1 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vhead = (vhead ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead ≠ first, vtail1 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), listp((rl3 + vhead ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp(vhead ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl3 + vhead ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps0[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl0) + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl1), ¬ dups(rl0 + qrl), ¬ dups(rl1 + rl0), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ vhead ∈ rl0, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs0[vhead].next ≠ null ∧ vs0[vs0[vhead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead0 ∈ rl3 + vhead ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ x + [] = x; (s) ⊦ [] + x = 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 '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 326 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vhead].deqID = vs0[vhead].deqID, ps0[first].next = ps[first].next, ps0[vhead].next = vs0[vhead].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[vhead].val = vs0[vhead].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs0[vhead].next ≠ vhead, first ≠ lst, first ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, vhead ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), listp(qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vs0[vhead].next].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl0) + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl1), ¬ dups(rl0 + qrl), ¬ dups(rl1 + rl0), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ weak?(vs0[vhead].deqID), ¬ vhead ∈ rl0, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, vs0[vhead].next ≠ null → rvowns0(vretRefs0(vs0[vs0[vhead].next].deqID.tid)) = Claimed(vs0[vs0[vhead].next].deqID.tid, vs0[vs0[vhead].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs0[vs0[vhead].next].deqID, tid0]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs0[vhead].next].deqID, tid0

Proof step 327 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, ps0[vhead].deqID = vs0[vhead].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vs0[vhead].next].deqID = Some(tid0), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps0[vhead].val = vs0[vhead].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs0[vhead].next ≠ vhead, first ≠ lst, first ≠ vs0[vhead].next, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ first, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp(qrl + rl, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[vhead].next].deqID), some?(vs0[vs0[vhead].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + rl0) + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl1), ¬ dups(rl0 + qrl), ¬ dups(rl1 + rl0), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ weak?(vs0[vhead].deqID), ¬ vhead ∈ rl0, ¬ vhead ∈ rl1, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[vs0[vhead].next].deqID ≠ Some(tid), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead].next ≠ null → vs0[vs0[vhead].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ some?(Some(tid)); (s)

Proof step 328 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, ps0[vhead].deqID = vs0[vhead].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vs0[vhead].next].deqID = Some(tid0), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps0[vhead].val = vs0[vhead].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp(qrl + rl, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[vhead].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl1, ¬ vhead ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → tid0 ≠ tid, ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead].next ≠ null → tid0 ≠ tid) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Proof step 329 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, vs0[vs0[vhead].next].deqID = Some(tid0), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vhead].deqID = vs0[vhead].deqID, ps0[first].next = ps[first].next, ps0[vhead].next = vs0[vhead].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[vhead].val = vs0[vhead].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), tid0 = tid, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ null, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), listp(qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vs0[vhead].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl1, ¬ vhead ∈ rl0, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → tid0 ≠ tid, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 330 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, ps0[vhead].deqID = vs0[vhead].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vs0[vhead].next].deqID = Some(tid), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps0[vhead].val = vs0[vhead].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vhead].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ null, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, vhead ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp(qrl + rl, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[vhead].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl1, ¬ vhead ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl0

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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ None ≠ Some(tid); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist]

Proof step 331 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, vs0[qrl0.head].deqID = Some(tid), vs0[vs0[vhead].next].deqID = Some(tid0), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[vhead].deqID = vs0[vhead].deqID, ps0[first].next = ps[first].next, ps0[vhead].next = vs0[vhead].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[vhead].val = vs0[vhead].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, qrl0 ≠ [], vhead ≠ null, vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), listp(qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vs0[vhead].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[vhead].deqID), some?(ps[vhead].deqID), some?(vs0[vhead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead ∈ vs0, vhead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl1, ¬ vhead ∈ rl0, vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → tid0 ≠ tid, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 332 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[vhead].next ' + qrl0, ps0[vhead].deqID = vs0[vhead].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vs0[vhead].next].deqID = Some(tid0), vs0[qrl0.head].deqID = Some(tid), ps0[vhead].next = vs0[vhead].next, ps0[first].next = ps[first].next, ps0[vhead].val = vs0[vhead].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(vhead) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, vs0[vhead].next ≠ vhead, ps[first].next ≠ null, first ≠ vs0[vhead].next, first ≠ lst, phead0 ≠ vs0[vhead].next, pretRefs0(tid) ≠ null, qrl0 ≠ [], vhead ≠ null, vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead ' + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, ps0, owns0), listp(qrl + rl, vs0, ps0, owns0), listp(first ' + (rl0 + vhead ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead, vs0), noid(tid, (rl1 + first ' + rl0) + vhead ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl0) + vhead ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead].deqID), some?(ps[vhead].deqID), some?(vs[vhead].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[vhead].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ ps0, vhead ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl0) + vhead ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ weak?(vs0[vhead].deqID), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead].next ∈ rl1, ¬ vs0[vhead].next ∈ qrl0, ¬ vs0[vhead].next ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ rl1, ¬ vhead ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vhead ' + qrl).last].next ≠ null → vs0[(vhead ' + qrl).last].next = vs[(vhead ' + qrl).last].next ∧ vs0[vs0[(vhead ' + qrl).last].next].val = vs[vs0[(vhead ' + qrl).last].next].val, vs0[vhead].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead].next].val), vs0[vhead].next ≠ ps[first].next ∧ vs0[vhead].next ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → tid0 ≠ tid, ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + rl0) + vhead ' from phead ∨ phead0 ∈ qrl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead ∨ vs[first].next ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead, lst ∈ rl0 ∨ lst = vhead ∨ lst ∈ qrl, vs0[vhead].next ∈ qrl ∨ vs0[vhead].next ∈ rl, vtail0 = (qrl + rl).last ∨ vtail0 = (vs0[vhead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead ') + qrl + rl from ps[first].next

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, vtail1, rl2]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ 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 ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) 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] ⊦ None ≠ Some(tid); (s) ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 333 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), (first ' + rl0).last = vhead, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ vhead0, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl0 ∨ vhead = vhead0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 334 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, qrl + rl = vtail1 ' + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ vhead0, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottidRely(tid, (first ' + rl0).last, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from (first ' + rl0).last, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + rl0).last = first, ps[ps[first].next].deqID = None → (first ' + rl0).last = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[(first ' + rl0).last].next ≠ null ∧ vs[vs[(first ' + rl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl0).last].next].deqID.tid, vs[vs[(first ' + rl0).last].next].val), (first ' + rl0).last ≠ first → nextnottid(tid, (first ' + rl0).last, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, (first ' + rl0).last = first ∨ (first ' + rl0).last ∈ rl0 ∨ (first ' + rl0).last = vhead0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: first ', rl0

Proof step 335 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 336 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ vhead0, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottidRely(tid, (first ' + rl0).last, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from (first ' + rl0).last, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[first].next ≠ null → vs0[first].next = vs[first].next, (first ' + rl0).last ≠ first → nextnottid(tid, (first ' + rl0).last, vs), vs[(first ' + rl0).last].next ≠ null ∧ vs[vs[(first ' + rl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl0).last].next].deqID.tid, vs[vs[(first ' + rl0).last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → (first ' + rl0).last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + rl0).last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, (first ' + rl0).last = first ∨ (first ' + rl0).last ∈ rl0 ∨ (first ' + rl0).last = vhead0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ some?(Some(tid)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (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) ⊦ markedp([], vs); (s)

Proof step 337 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, vs[first].next ≠ first, first ≠ vtail1, first ≠ lst, first ≠ null, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vtail1 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl, vs, ps, owns), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vs[first].next].next ≠ null → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 338 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, qrl + rl = vtail1 ' + qrl0, vs0[vs0[vs[first].next].next].deqID = Some(tid), ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vs[first].next].next ≠ null, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ vtail1, first ≠ lst, first ≠ null, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vtail1 ≠ vs[first].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first, lst = vs[first].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ⊦

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 339 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, qrl + rl = vtail1 ' + qrl0, vs0[vs0[vs[first].next].next].deqID = Some(tid), ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, first ≠ null, first ≠ lst, first ≠ vtail1, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vtail1 ≠ vs[first].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first, lst = vs[first].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ 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 340 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[vs0[vs[first].next].next].deqID = Some(tid), vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), qrl = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, first ≠ null, first ≠ lst, first ≠ vtail1, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vtail1 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl, vs, ps, owns), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ 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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) ⊦ some?(Some(tid)); (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) 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 in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (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) ⊦ unmarkedp([], vs); (s)

Proof step 341 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, vs0[vs0[vs[first].next].next].deqID = Some(tid), ps0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].next = null, ps[first].val = vs0[first].val, vs0[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = ps0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, ps0[vs[first].next].next ≠ vs[first].next, first ≠ null, first ≠ ps0[vs[first].next].next, phead ≠ vs[first].next, phead0 ≠ ps0[vs[first].next].next, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + ps0[vs[first].next].next ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + ps0[vs[first].next].next ' + qrl0, vs0, ps0, owns0), listp(rl3 + vs[first].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl3 + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + ps0[vs[first].next].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl3 + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vs[first].next].next].deqID), some?(ps0[ps0[vs[first].next].next].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), pretRefs0(tid) ∈ vrvHp, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, vs[first].next ∈ ps, ps0[vs[first].next].next ∈ vs0, ps0[vs[first].next].next ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ ps0[vs[first].next].next ∈ qrl0, ¬ ps0[vs[first].next].next ∈ rl1, ¬ first ∈ rl1, qrl0.head ≠ vs[first].next ∧ ([].head = ps0[vs[first].next].next ∨ qrl0 ≠ []) → vs0[qrl0.head].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs[vs[first].next].next ≠ null → vs[vs[first].next].next ∈ vs ∧ vs[vs[first].next].next ∈ ps ∧ ps[vs[vs[first].next].next] = vs[vs[vs[first].next].next] ∧ ps[vs[vs[first].next].next].deqID = None ∧ ps[vs[vs[first].next].next].next = null ∧ weak?(owns(vs[vs[first].next].next)), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next ∧ vs0[vs0[vs[first].next].next].val = vs[vs0[vs[first].next].next].val, ∀ r0. r0 ≠ vs[first].next ∧ (r0 = ps0[vs[first].next].next ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = vs[first].next ∨ vtail0 = ps0[vs[first].next].next ∨ vtail0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = (ps0[vs[first].next].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vs[first].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next = ps0[vs[first].next].next ∨ vs0[vs[first].next].next ∈ qrl0)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ', vs[first].next, rl3 + vs[first].next ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ', vs[first].next, rl3 + vs[first].next ' + qrl1

Proof step 342 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 343 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = (rl3 + vs[first].next ' + qrl1).butlast, ps[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = Some(tid), vs0[vs0[vs[first].next].next].deqID = Some(tid), ps[vs[first].next].next = null, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, vs[first].next = (rl3 + vs[first].next ' + qrl1).last, ps[vs[first].next].val = ps0[vs[first].next].val, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = ps0[vs[first].next].val, vs0[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + vs[first].next ' + qrl1 ≠ [], vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, ps0[vs[first].next].next ≠ vs[first].next, first ≠ null, first ≠ ps0[vs[first].next].next, phead ≠ vs[first].next, phead0 ≠ ps0[vs[first].next].next, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + ps0[vs[first].next].next ' + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + ps0[vs[first].next].next ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl3 + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl3 + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + ps0[vs[first].next].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[ps0[vs[first].next].next].deqID), some?(vs0[ps0[vs[first].next].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), ps0[vs[first].next].next ∈ ps0, ps0[vs[first].next].next ∈ vs0, vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ ps0[vs[first].next].next ∈ qrl0, ¬ ps0[vs[first].next].next ∈ rl1, ¬ first ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next ∧ vs0[vs0[vs[first].next].next].val = vs[vs0[vs[first].next].next].val, vs[vs[first].next].next ≠ null → vs[vs[first].next].next ∈ vs ∧ vs[vs[first].next].next ∈ ps ∧ ps[vs[vs[first].next].next] = vs[vs[vs[first].next].next] ∧ ps[vs[vs[first].next].next].deqID = None ∧ ps[vs[vs[first].next].next].next = null ∧ weak?(owns(vs[vs[first].next].next)), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, qrl0.head ≠ vs[first].next ∧ ([].head = ps0[vs[first].next].next ∨ qrl0 ≠ []) → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 = ps0[vs[first].next].next ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail0 = (ps0[vs[first].next].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vs[first].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = vs[first].next ∨ vtail0 = ps0[vs[first].next].next ∨ vtail0 ∈ qrl0 ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next = ps0[vs[first].next].next ∨ vs0[vs[first].next].next ∈ qrl0)

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) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 344 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = rl3 + (vs[first].next ' + qrl1).butlast, ps[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = Some(tid), vs0[vs0[vs[first].next].next].deqID = Some(tid), ps[vs[first].next].next = null, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, vs[first].next = (vs[first].next ' + qrl1).last, ps[vs[first].next].val = ps0[vs[first].next].val, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = ps0[vs[first].next].val, vs0[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps0[vs[first].next].next ≠ vs[first].next, vs0[vs[first].next].next ≠ null, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ ps0[vs[first].next].next, first ≠ null, phead ≠ vs[first].next, phead0 ≠ ps0[vs[first].next].next, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + vs[first].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + ps0[vs[first].next].next ' + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + ps0[vs[first].next].next ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl3 + vs[first].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl3 + vs[first].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + ps0[vs[first].next].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[ps0[vs[first].next].next].deqID), some?(vs0[ps0[vs[first].next].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), ps0[vs[first].next].next ∈ ps0, ps0[vs[first].next].next ∈ vs0, vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ ps0[vs[first].next].next ∈ rl1, ¬ ps0[vs[first].next].next ∈ qrl0, ¬ first ∈ qrl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next ∧ vs0[vs0[vs[first].next].next].val = vs[vs0[vs[first].next].next].val, vs[vs[first].next].next ≠ null → vs[vs[first].next].next ∈ vs ∧ vs[vs[first].next].next ∈ ps ∧ ps[vs[vs[first].next].next] = vs[vs[vs[first].next].next] ∧ ps[vs[vs[first].next].next].deqID = None ∧ ps[vs[vs[first].next].next].next = null ∧ weak?(owns(vs[vs[first].next].next)), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, qrl0.head ≠ vs[first].next ∧ ([].head = ps0[vs[first].next].next ∨ qrl0 ≠ []) → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 = ps0[vs[first].next].next ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), phead ∈ rl1 ∨ phead = first, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail0 = (ps0[vs[first].next].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vs[first].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = vs[first].next ∨ vtail0 = ps0[vs[first].next].next ∨ vtail0 ∈ qrl0, first ∈ rl3 ∨ first ∈ (vs[first].next ' + qrl1).butlast ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next = ps0[vs[first].next].next ∨ vs0[vs[first].next].next ∈ qrl0)

Heuristic use patterns 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 ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ c ∈ y ∧ c ≠ b → y + b ' ≠ y0 + c ' + z; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ [] + x = 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) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = 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 Used terms: vs[first].next ', qrl1

Proof step 345 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 346 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[vs0[vs[first].next].next].deqID = Some(tid), vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), qrl = first0 + qrl2, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, first ≠ null, first ≠ lst, first ≠ vtail1, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vtail1 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl, vs, ps, owns), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ 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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ some?(Some(tid)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 347 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, ps[vs[first].next].deqID = Some(tid), vs[ps0[vs[first].next].next].deqID = None, ps[ps0[vs[first].next].next].deqID = None, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = Some(tid), vs0[vs0[vs[first].next].next].deqID = Some(tid), vs[vs[first].next].next = ps0[vs[first].next].next, ps[vs[first].next].next = ps0[vs[first].next].next, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = ps0[vs[first].next].val, vs0[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps0[vs[first].next].next ≠ vs[first].next, vs0[vs[first].next].next ≠ null, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ ps0[vs[first].next].next, first ≠ lst, first ≠ null, phead ≠ vs[first].next, phead0 ≠ ps0[vs[first].next].next, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + ps0[vs[first].next].next ') + qrl2 + rl, vs0, ps0, owns0), listp(ps0[vs[first].next].next ' + qrl2, vs, ps, owns), listp(rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[ps0[vs[first].next].next].deqID), some?(vs0[ps0[vs[first].next].next].deqID), unmarkedp(qrl2, vs), unmarkedp(qrl2, vs0), unmarkedp(rl, vs0), unmarkedp(qrl2, ps), unmarkedp(qrl2, ps0), unmarkedp(rl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl from vtail, vs[first].next ∈ ps, vs[first].next ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + rl), ¬ dups(qrl2), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2 + rl), ¬ dups(rl1 + qrl2), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl2, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ ps0[vs[first].next].next ∈ qrl2, ¬ first ∈ rl1, ¬ ps0[vs[first].next].next ∈ rl1, ¬ ps0[vs[first].next].next ∈ rl, ¬ first ∈ rl, (qrl2 + rl).head ≠ vs[first].next ∧ ((qrl2 + rl).head = ps0[vs[first].next].next ∨ (qrl2 + rl).head ∈ qrl2 ∨ (qrl2 + rl).head ∈ rl) → vs0[(qrl2 + rl).head].deqID ≠ Some(tid), vs[(ps0[vs[first].next].next ' + qrl2).last].next ≠ null → vs0[(ps0[vs[first].next].next ' + qrl2).last].next = vs[(ps0[vs[first].next].next ' + qrl2).last].next ∧ vs0[vs0[(ps0[vs[first].next].next ' + qrl2).last].next].val = vs[vs0[(ps0[vs[first].next].next ' + qrl2).last].next].val, ps0[vs[first].next].next ≠ null → vs0[vs[first].next].next = ps0[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ (r0 = ps0[vs[first].next].next ∨ r0 ∈ qrl2 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = ps0[vs[first].next].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), lst = vs[first].next ∨ lst = ps0[vs[first].next].next ∨ lst ∈ qrl2, vtail = (ps0[vs[first].next].next ' + qrl2).last ∨ vtail = (vs[first].next ' + (ps0[vs[first].next].next ' + qrl2).butlast).last ∧ vs[(ps0[vs[first].next].next ' + qrl2).last].deqID = None ∧ vs[(ps0[vs[first].next].next ' + qrl2).last].next = null, vtail0 = ((ps0[vs[first].next].next ' + qrl2) + rl).last ∨ qrl2 + rl ≠ [] ∧ vtail0 = (ps0[vs[first].next].next ' + (qrl2 + rl).butlast).last ∧ vs0[(qrl2 + rl).last].deqID = None ∧ vs0[(qrl2 + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl2 ∨ phead0 ∈ rl ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next = ps0[vs[first].next].next ∨ vs0[vs[first].next].next ∈ qrl2 ∨ vs0[vs[first].next].next ∈ rl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ', vs[first].next, rl3 + vs[first].next ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ', vs[first].next, rl3 + vs[first].next ' + qrl1

Proof step 348 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 349 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = (rl3 + vs[first].next ' + qrl1).butlast, vs0[vs0[vs[first].next].next].deqID = Some(tid), ps0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[ps0[vs[first].next].next].deqID = None, vs[ps0[vs[first].next].next].deqID = None, ps[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].next = ps0[vs[first].next].next, vs[vs[first].next].next = ps0[vs[first].next].next, vs[first].next = (rl3 + vs[first].next ' + qrl1).last, ps[first].val = vs0[first].val, vs0[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = ps0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + vs[first].next ' + qrl1 ≠ [], ps0[vs[first].next].next ≠ vs[first].next, vs0[vs[first].next].next ≠ null, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ ps0[vs[first].next].next, first ≠ lst, first ≠ null, phead ≠ vs[first].next, phead0 ≠ ps0[vs[first].next].next, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl, vs0, ps0, owns0), listp(rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs, ps, owns), listp(ps0[vs[first].next].next ' + qrl2, vs, ps, owns), listp(vs[first].next ' + (qrl1 + ps0[vs[first].next].next ') + qrl2 + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vs[first].next].next].deqID), some?(ps0[ps0[vs[first].next].next].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl2, ps0), unmarkedp(qrl2, ps), unmarkedp(rl, vs0), unmarkedp(qrl2, vs0), unmarkedp(qrl2, vs), vs[first].next ∈ vs, vs[first].next ∈ ps, vtail0 ∈ rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2 + rl), ¬ dups(qrl2), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2 + rl), ¬ dups(rl1 + qrl2), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl2, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ ps0[vs[first].next].next ∈ qrl2, ¬ first ∈ rl1, ¬ ps0[vs[first].next].next ∈ rl1, ¬ ps0[vs[first].next].next ∈ rl, ¬ first ∈ rl, ps0[vs[first].next].next ≠ null → vs0[vs[first].next].next = ps0[vs[first].next].next, vs[(ps0[vs[first].next].next ' + qrl2).last].next ≠ null → vs0[(ps0[vs[first].next].next ' + qrl2).last].next = vs[(ps0[vs[first].next].next ' + qrl2).last].next ∧ vs0[vs0[(ps0[vs[first].next].next ' + qrl2).last].next].val = vs[vs0[(ps0[vs[first].next].next ' + qrl2).last].next].val, (qrl2 + rl).head ≠ vs[first].next ∧ ((qrl2 + rl).head = ps0[vs[first].next].next ∨ (qrl2 + rl).head ∈ qrl2 ∨ (qrl2 + rl).head ∈ rl) → vs0[(qrl2 + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = ps0[vs[first].next].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 = ps0[vs[first].next].next ∨ r0 ∈ qrl2 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl2 ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = ((ps0[vs[first].next].next ' + qrl2) + rl).last ∨ qrl2 + rl ≠ [] ∧ vtail0 = (ps0[vs[first].next].next ' + (qrl2 + rl).butlast).last ∧ vs0[(qrl2 + rl).last].deqID = None ∧ vs0[(qrl2 + rl).last].next = null, vtail = (ps0[vs[first].next].next ' + qrl2).last ∨ vtail = (vs[first].next ' + (ps0[vs[first].next].next ' + qrl2).butlast).last ∧ vs[(ps0[vs[first].next].next ' + qrl2).last].deqID = None ∧ vs[(ps0[vs[first].next].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst = ps0[vs[first].next].next ∨ lst ∈ qrl2 ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next = ps0[vs[first].next].next ∨ vs0[vs[first].next].next ∈ qrl2 ∨ vs0[vs[first].next].next ∈ 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 350 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' = rl3 + (vs[first].next ' + qrl1).butlast, vs0[vs0[vs[first].next].next].deqID = Some(tid), ps0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[ps0[vs[first].next].next].deqID = None, vs[ps0[vs[first].next].next].deqID = None, ps[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].next = ps0[vs[first].next].next, vs[vs[first].next].next = ps0[vs[first].next].next, vs[first].next = (vs[first].next ' + qrl1).last, ps[first].val = vs0[first].val, vs0[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = ps0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ first, vs[first].next ≠ null, vs0[vs[first].next].next ≠ null, ps0[vs[first].next].next ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ ps0[vs[first].next].next, phead ≠ vs[first].next, phead0 ≠ ps0[vs[first].next].next, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl, vs0, ps0, owns0), listp(rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs, ps, owns), listp(ps0[vs[first].next].next ' + qrl2, vs, ps, owns), listp(vs[first].next ' + (qrl1 + ps0[vs[first].next].next ') + qrl2 + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vs[first].next].next].deqID), some?(ps0[ps0[vs[first].next].next].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl2, ps0), unmarkedp(qrl2, ps), unmarkedp(rl, vs0), unmarkedp(qrl2, vs0), unmarkedp(qrl2, vs), vs[first].next ∈ vs, vs[first].next ∈ ps, vtail0 ∈ rl1 + first ' + vs[first].next ' + (ps0[vs[first].next].next ' + qrl2) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl3 + vs[first].next ' + qrl1 + ps0[vs[first].next].next ' + qrl2 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl2), ¬ dups(rl1 + qrl2 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ ps0[vs[first].next].next ∈ rl, ¬ ps0[vs[first].next].next ∈ rl1, ¬ first ∈ rl1, ¬ ps0[vs[first].next].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl2, ¬ first ∈ qrl2, ps0[vs[first].next].next ≠ null → vs0[vs[first].next].next = ps0[vs[first].next].next, vs[(ps0[vs[first].next].next ' + qrl2).last].next ≠ null → vs0[(ps0[vs[first].next].next ' + qrl2).last].next = vs[(ps0[vs[first].next].next ' + qrl2).last].next ∧ vs0[vs0[(ps0[vs[first].next].next ' + qrl2).last].next].val = vs[vs0[(ps0[vs[first].next].next ' + qrl2).last].next].val, (qrl2 + rl).head ≠ vs[first].next ∧ ((qrl2 + rl).head = ps0[vs[first].next].next ∨ (qrl2 + rl).head ∈ qrl2 ∨ (qrl2 + rl).head ∈ rl) → vs0[(qrl2 + rl).head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = ps0[vs[first].next].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 = ps0[vs[first].next].next ∨ r0 ∈ qrl2 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl2 ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = ((ps0[vs[first].next].next ' + qrl2) + rl).last ∨ qrl2 + rl ≠ [] ∧ vtail0 = (ps0[vs[first].next].next ' + (qrl2 + rl).butlast).last ∧ vs0[(qrl2 + rl).last].deqID = None ∧ vs0[(qrl2 + rl).last].next = null, vtail = (ps0[vs[first].next].next ' + qrl2).last ∨ vtail = (vs[first].next ' + (ps0[vs[first].next].next ' + qrl2).butlast).last ∧ vs[(ps0[vs[first].next].next ' + qrl2).last].deqID = None ∧ vs[(ps0[vs[first].next].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst = ps0[vs[first].next].next ∨ lst ∈ qrl2, first ∈ rl3 ∨ first ∈ (vs[first].next ' + qrl1).butlast ⊦ vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next = ps0[vs[first].next].next ∨ vs0[vs[first].next].next ∈ qrl2 ∨ vs0[vs[first].next].next ∈ rl)

Heuristic use patterns 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 ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ c ∈ y ∧ c ≠ b → y + b ' ≠ y0 + c ' + z; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ [] + x = 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) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = 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 Used terms: vs[first].next ', qrl1

Proof step 351 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 352 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, qrl + rl = vtail1 ' + qrl0, vs0[qrl0.head].deqID = Some(tid), ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, vs[first].next ≠ first, first ≠ vtail1, first ≠ lst, first ≠ null, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail1 ≠ vs[first].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), markedp(rl1, vs), markedp(rl1, ps), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl) → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first, lst = vs[first].next ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 353 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + vs[first].next ' = rl3 + vs[first].next ' + qrl1, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[qrl0.head].deqID = Some(tid), vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, vs[first].next ≠ first, first ≠ vtail1, first ≠ lst, first ≠ null, phead ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail1 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl, vs, ps, owns), listp((rl3 + vs[first].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), markedp(rl1, vs0), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, (rl3 + vs[first].next ' + qrl1) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vs[first].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vs[first].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vs[first].next].next ≠ vs[first].next ∧ (vs0[vs[first].next].next ∈ qrl ∨ vs0[vs[first].next].next ∈ rl) → vs0[vs0[vs[first].next].next].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl).last].next ≠ null → vs0[(vs[first].next ' + qrl).last].next = vs[(vs[first].next ' + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + qrl).last].next].val = vs[vs0[(vs[first].next ' + qrl).last].next].val, vs0[vs[first].next].next ≠ null ∧ vs0[vs0[vs[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs[first].next].next].deqID.tid, vs0[vs0[vs[first].next].next].val), ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + vs[first].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl ∨ qrl0.head ∈ rl)

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, phead1, rl0]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (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] ⊦ None ≠ Some(tid); (s) ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 354 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ vhead0, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottidRely(tid, rl0.last, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from rl0.last, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[first].next ≠ null → vs0[first].next = vs[first].next, rl0.last ≠ first → nextnottid(tid, rl0.last, vs), vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → rl0.last = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → rl0.last = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, rl0.last = first ∨ rl0.last ∈ rl0 ∨ rl0.last = vhead0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) 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) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 355 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, qrl + rl = vtail1 ' + qrl0, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, rl0.last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ vhead0, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), nextnottid(tid, rl0.last, vs), nextnottidRely(tid, rl0.last, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from rl0.last, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [rl0, phead1, qrl2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, phead1, y

Proof step 356 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = qrl2 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ vhead0, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1) + qrl, vs, ps, owns), listp(first ' + (rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + (rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead0 ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vhead0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from phead1, vtail0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead0 ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups((rl1 + rl0) + qrl), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl0), ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vhead0 ' + qrl).last].next ≠ null → vs0[(vhead0 ' + qrl).last].next = vs[(vhead0 ' + qrl).last].next ∧ vs0[vs0[(vhead0 ' + qrl).last].next].val = vs[vs0[(vhead0 ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + (rl0 + vhead0 ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vhead0 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + vhead0 ' + qrl1 from phead ∨ phead0 ∈ qrl0, lst ∈ rl0 ∨ lst = vhead0 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail = (vhead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vhead0 ∨ ps[first].next ∈ qrl ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 357 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + (qrl2 + phead1 ') + ps[phead1].next ' = rl3 + ps[phead1].next ' + qrl1, qrl + rl = vtail1 ' + qrl0, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[phead1].next ≠ first, ps[phead1].next ≠ phead1, first ≠ vtail1, first ≠ lst, phead ≠ ps[phead1].next, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, vtail1 ≠ ps[phead1].next, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), listp((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp(ps[phead1].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl3 + ps[phead1].next ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps0[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + ps[phead1].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ phead1 ∈ qrl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ first ∈ qrl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null ∧ vs0[vs0[ps[phead1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[phead1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[phead1].next].next].deqID.tid, vs0[vs0[ps[phead1].next].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + ps[phead1].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + qrl2 + phead1 ', ps[phead1].next, rl3 + ps[phead1].next ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + qrl2 + phead1 ', ps[phead1].next, rl3 + ps[phead1].next ' + qrl1

Proof step 358 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 359 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + qrl2 + phead1 ' = (rl3 + ps[phead1].next ' + qrl1).butlast, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps[phead1].next = (rl3 + ps[phead1].next ' + qrl1).last, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + ps[phead1].next ' + qrl1 ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, ps[phead1].next ≠ first, ps[phead1].next ≠ phead1, first ≠ vtail1, first ≠ lst, phead ≠ ps[phead1].next, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, vtail1 ≠ ps[phead1].next, vtail1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(ps[phead1].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, ps, owns), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl3 + ps[phead1].next ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + ps[phead1].next ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ phead1 ∈ qrl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ first ∈ qrl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null ∧ vs0[vs0[ps[phead1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[phead1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[phead1].next].next].deqID.tid, vs0[vs0[ps[phead1].next].next].val), vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + ps[phead1].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 360 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl2 + phead1 ' = rl3 + (ps[phead1].next ' + qrl1).butlast, qrl + rl = vtail1 ' + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps[phead1].next = (ps[phead1].next ' + qrl1).last, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead ≠ ps[phead1].next, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ ps[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(ps[phead1].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, ps, owns), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl3 + ps[phead1].next ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(ps0[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + ps[phead1].next ' + qrl1) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(qrl), ¬ dups(qrl2 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl), ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ qrl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl2, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null ∧ vs0[vs0[ps[phead1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[phead1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[phead1].next].next].deqID.tid, vs0[vs0[ps[phead1].next].next].val), vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ qrl ∨ vtail1 ∈ rl, phead0 ∈ rl3 + ps[phead1].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead1 ∈ rl3 ∨ phead1 ∈ (ps[phead1].next ' + qrl1).butlast ⊦ (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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] → [ps[phead1].next ', qrl1], <all paths>

Additional information

Used terms: ps[phead1].next ', qrl1

Proof step 361 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 362 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + qrl2 + phead1 ' = rl3 + (ps[phead1].next ' + qrl1).butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps[phead1].next = (ps[phead1].next ' + qrl1).last, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl1 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead ≠ ps[phead1].next, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, vtail1 ≠ phead1, vtail1 ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), listp((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp(ps[phead1].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl3 + ps[phead1].next ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps0[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + ps[phead1].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(qrl), ¬ dups(qrl2 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl), ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ qrl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl2, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null ∧ vs0[vs0[ps[phead1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[phead1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[phead1].next].next].deqID.tid, vs0[vs0[ps[phead1].next].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 ∈ rl3 ∨ phead1 ∈ (ps[phead1].next ' + qrl1).butlast, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + ps[phead1].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ [] + x = 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 '.last = a; (s)

Proof step 363 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[ps[phead1].next].next ' + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, vs0[ps[phead1].next].next ≠ phead1, vs0[ps[phead1].next].next ≠ ps[phead1].next, ps[phead1].next ≠ null, first ≠ lst, first ≠ vs0[ps[phead1].next].next, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), listp(qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(vs0[vs0[ps[phead1].next].next].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, ps[phead1].next ∈ vs0, ps[phead1].next ∈ ps0, phead1 ∈ vs, phead1 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(qrl), ¬ dups(qrl2 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl2, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(vs0[vs0[ps[phead1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[phead1].next].next].deqID.tid, vs0[vs0[ps[phead1].next].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs0[ps[phead1].next].next ∈ qrl ∨ vs0[ps[phead1].next].next ∈ rl, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs0[vs0[ps[phead1].next].next].deqID, tid0]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs0[ps[phead1].next].next].deqID, tid0

Proof step 364 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[ps[phead1].next].next ' + qrl0, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, vs0[ps[phead1].next].next ≠ phead1, vs0[ps[phead1].next].next ≠ ps[phead1].next, ps[phead1].next ≠ null, first ≠ lst, first ≠ vs0[ps[phead1].next].next, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp(qrl + rl, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs0[vs0[ps[phead1].next].next].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead1 ∈ ps, phead1 ∈ vs, ps[phead1].next ∈ ps0, ps[phead1].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(qrl), ¬ dups(qrl2 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl2, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs0[ps[phead1].next].next ∈ qrl ∨ vs0[ps[phead1].next].next ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ some?(Some(tid)); (s)

Proof step 365 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[ps[phead1].next].next ' + qrl0, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ null, vs0[ps[phead1].next].next ≠ ps[phead1].next, vs0[ps[phead1].next].next ≠ phead1, ps[first].next ≠ null, ps[phead1].next ≠ first, ps[phead1].next ≠ phead1, first ≠ vs0[ps[phead1].next].next, first ≠ lst, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp(qrl + rl, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead1 ∈ ps, phead1 ∈ vs, ps[phead1].next ∈ ps0, ps[phead1].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ phead1 ∈ qrl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ first ∈ qrl2, ¬ first ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → tid0 ≠ tid, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs0[ps[phead1].next].next ∈ qrl ∨ vs0[ps[phead1].next].next ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 366 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[ps[phead1].next].next ' + qrl0, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), qrl = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ null, vs0[ps[phead1].next].next ≠ ps[phead1].next, vs0[ps[phead1].next].next ≠ phead1, ps[first].next ≠ null, ps[phead1].next ≠ first, ps[phead1].next ≠ phead1, first ≠ vs0[ps[phead1].next].next, first ≠ lst, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), listp(qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, ps[phead1].next ∈ vs0, ps[phead1].next ∈ ps0, phead1 ∈ vs, phead1 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ phead1 ∈ qrl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ first ∈ qrl2, ¬ first ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → tid0 ≠ tid, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs0[ps[phead1].next].next ∈ qrl ∨ vs0[ps[phead1].next].next ∈ rl, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) list-elem-in1: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ vs; (forward) from specification DMSQ list-elem-in2: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ ps; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s)

Proof step 367 from proof stable-D20 (previous step) (back to tree)

vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, vs0[ps[phead1].next].next ≠ phead1, vs0[ps[phead1].next].next ≠ ps[phead1].next, ps[phead1].next ≠ null, first ≠ lst, first ≠ vs0[ps[phead1].next].next, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + qrl2 + phead1 ' + ps[phead1].next ', vs, ps, owns), listp(vs0[ps[phead1].next].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ', ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vs0[ps[phead1].next].next ∈ ps0, vs0[ps[phead1].next].next ∈ vs0, pretRefs0(tid) ∈ vrvHp, ps[phead1].next ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, ps[phead1].next ∈ vs0, ps[phead1].next ∈ ps0, phead1 ∈ vs, phead1 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(qrl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl2), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl0, ¬ first ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl2, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl0 from ps[first].next → tid0 ≠ tid, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[ps[phead1].next].next ≠ null → vs0[ps[phead1].next].next = vs[ps[phead1].next].next ∧ vs0[vs0[ps[phead1].next].next].val = vs[vs0[ps[phead1].next].next].val, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next, vtail0 = (vs0[ps[phead1].next].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, vtail0 = ps[phead1].next ∨ vtail0 = vs0[ps[phead1].next].next ∨ vtail0 ∈ qrl0 ⊦ (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl2

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 ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ None ≠ Some(tid); (s) ⊦ some?(Some(tid)); (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + 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] ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (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) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 368 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vs0[ps[phead1].next].next ' + qrl0, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), qrl = phead2 + qrl1, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ null, vs0[ps[phead1].next].next ≠ ps[phead1].next, vs0[ps[phead1].next].next ≠ phead1, ps[first].next ≠ null, ps[phead1].next ≠ first, ps[phead1].next ≠ phead1, first ≠ vs0[ps[phead1].next].next, first ≠ lst, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), listp(qrl + rl, vs0, ps0, owns0), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl, vs), vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, ps[phead1].next ∈ vs0, ps[phead1].next ∈ ps0, phead1 ∈ vs, phead1 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ phead1 ∈ qrl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ first ∈ qrl2, ¬ first ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ qrl0, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → tid0 ≠ tid, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs0[ps[phead1].next].next ∈ qrl ∨ vs0[ps[phead1].next].next ∈ rl, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ None ≠ Some(tid); (s) ⊦ (a ' + x).head = a; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 369 from proof stable-D20 (previous step) (back to tree)

ps[vs0[ps[phead1].next].next].deqID = None, vs[vs0[ps[phead1].next].next].deqID = None, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[phead1].next = ps[phead1].next, ps0[first].next = ps[first].next, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, vs0[ps[phead1].next].next ≠ phead1, vs0[ps[phead1].next].next ≠ ps[phead1].next, ps[phead1].next ≠ null, first ≠ lst, first ≠ vs0[ps[phead1].next].next, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), listp((vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), markedp(qrl2, ps0), markedp(rl1, ps0), markedp(qrl2, vs), markedp(rl1, vs), markedp(qrl2, ps), markedp(rl1, ps), markedp(qrl2, vs0), markedp(rl1, vs0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs0[ps[phead1].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps0), unmarkedp(rl, ps0), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, ps[phead1].next ∈ vs0, ps[phead1].next ∈ ps0, phead1 ∈ vs, phead1 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl1 + rl), ¬ dups((rl1 + qrl2) + qrl1), ¬ dups(rl1), ¬ dups(qrl2 + qrl1 + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl1 + rl), ¬ dups(rl1 + qrl2 + qrl1), ¬ dups(rl), ¬ dups(qrl2), ¬ dups(qrl2 + qrl1), ¬ dups(qrl1), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ ps[phead1].next ∈ qrl1, ¬ first ∈ qrl1, ¬ first ∈ rl, ¬ vs0[ps[phead1].next].next ∈ rl, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ qrl1, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ rl, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → tid0 ≠ tid, (qrl1 + rl).head ≠ ps[first].next ∧ (qrl1 + rl).head ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ≠ null → vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next = vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ∧ vs0[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val = vs[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r = vs0[ps[phead1].next].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next = vs0[ps[phead1].next].next ∨ vs[first].next ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl1, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst = vs0[ps[phead1].next].next ∨ lst ∈ qrl1, vtail0 = ((vs0[ps[phead1].next].next ' + qrl1) + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, vtail = (vs0[ps[phead1].next].next ' + qrl1).last ∨ vtail = (ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1).butlast).last ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].deqID = None ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl ⊦ (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl1 + rl = [] ∨ vs0[(qrl1 + rl).head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl2

Additional information

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

Proof step 370 from proof stable-D20 (previous step) (back to tree)

ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), vs[vs0[ps[phead1].next].next].deqID = None, ps[vs0[ps[phead1].next].next].deqID = None, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, ps[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), qrl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, vs0[ps[phead1].next].next ≠ phead1, vs0[ps[phead1].next].next ≠ ps[phead1].next, ps[phead1].next ≠ null, first ≠ lst, first ≠ vs0[ps[phead1].next].next, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp((vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp(first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps), unmarkedp(rl, ps0), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs), phead1 ∈ ps, phead1 ∈ vs, ps[phead1].next ∈ ps0, ps[phead1].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl1 + rl), ¬ dups((rl1 + qrl2) + qrl1), ¬ dups(rl1), ¬ dups(qrl2 + qrl1 + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl1 + rl), ¬ dups(rl1 + qrl2 + qrl1), ¬ dups(rl), ¬ dups(qrl2), ¬ dups(qrl2 + qrl1), ¬ dups(qrl1), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ ps[phead1].next ∈ qrl1, ¬ first ∈ qrl1, ¬ first ∈ rl, ¬ vs0[ps[phead1].next].next ∈ rl, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ qrl1, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ rl, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ≠ null → vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next = vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ∧ vs0[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val = vs[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val, (qrl1 + rl).head ≠ ps[first].next ∧ (qrl1 + rl).head ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → tid0 ≠ tid, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r = vs0[ps[phead1].next].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vtail = (vs0[ps[phead1].next].next ' + qrl1).last ∨ vtail = (ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1).butlast).last ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].deqID = None ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].next = null, vtail0 = ((vs0[ps[phead1].next].next ' + qrl1) + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst = vs0[ps[phead1].next].next ∨ lst ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next = vs0[ps[phead1].next].next ∨ vs[first].next ∈ qrl1 ⊦ (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl1 + rl = [] ∨ vs0[(qrl1 + rl).head].deqID ≠ Some(tid))

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 ' + x).last = x.last; (s) ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ some?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = 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) ⊦ markedp([], vs); (s)

Proof step 371 from proof stable-D20 (previous step) (back to tree)

vs0[vs[first].next].deqID = Some(tid), ps[vs[vs[first].next].next].deqID = vs[vs[vs[first].next].next].deqID, ps[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[vs[vs[first].next].next].deqID = vs0[vs[vs[first].next].next].deqID, ps0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs0[vs[vs[first].next].next].next].deqID = Some(tid0), vs[vs0[vs[vs[first].next].next].next].deqID = None, ps[vs0[vs[vs[first].next].next].next].deqID = None, (qrl1 + rl).head = vs[first].next, vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[vs[first].next].next].next = vs0[vs[vs[first].next].next].next, ps[vs[first].next].next = vs[vs[first].next].next, ps[first].next = vs[first].next, ps0[vs[vs[first].next].next].next = vs0[vs[vs[first].next].next].next, ps0[first].next = vs[first].next, ps0[vs[first].next].next = vs[vs[first].next].next, vs[vs[vs[first].next].next].next = vs0[vs[vs[first].next].next].next, vs0[first].next = vs[first].next, ps[vs[vs[first].next].next].val = vs[vs[vs[first].next].next].val, ps[first].val = ps0[first].val, ps0[vs[vs[first].next].next].val = vs0[vs[vs[first].next].next].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = ps0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs0[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[vs[first].next].next) = None, owns(vs[first].next) = None, owns(first) = None, owns0(vs[vs[first].next].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(vretRefs(vs[vs[vs[first].next].next].deqID.tid)) = Claimed(vs[vs[vs[first].next].next].deqID.tid, vs[vs[vs[first].next].next].val), rvowns(pretRefs0(tid)) = Claimed(tid, ps0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl1 + rl ≠ [], vs[first].next ≠ first, vs[vs[first].next].next ≠ null, vs0[vs[vs[first].next].next].next ≠ vs[vs[first].next].next, vs0[vs[vs[first].next].next].next ≠ vs[first].next, vs[first].next ≠ null, vs[vs[first].next].next ≠ first, vs[vs[first].next].next ≠ vs[first].next, first ≠ null, first ≠ vs0[vs[vs[first].next].next].next, first ≠ lst, phead ≠ vs[vs[first].next].next, phead0 ≠ vs0[vs[vs[first].next].next].next, pretRefs0(tid) ≠ null, tid0 ≠ tid, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1 + rl, vs0, ps0, owns0), listp((vs0[vs[vs[first].next].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp(vs0[vs[vs[first].next].next].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, vs[first].next, vs), nextnottidRely(tid, vs[first].next, vs, vs[vs[first].next].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vs[vs[first].next].next].deqID), some?(vs[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps0[vs0[vs[vs[first].next].next].next].deqID), unmarkedp(rl, vs0), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps), unmarkedp(rl, ps0), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs), vs[vs[first].next].next ∈ ps, vs[vs[first].next].next ∈ vs, vs[first].next ∈ ps, vs[first].next ∈ vs, vs[vs[first].next].next ∈ ps0, vs[vs[first].next].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + vs0[vs[vs[first].next].next].next ' + qrl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl1 + rl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1), ¬ dups(rl1 + qrl1 + rl), ¬ weak?(vs[first].deqID), ¬ weak?(vs[vs[vs[first].next].next].deqID), ¬ weak?(vs0[vs[vs[first].next].next].deqID), ¬ vs[vs[first].next].next ∈ rl, ¬ vs[vs[first].next].next ∈ rl1, ¬ vs0[vs[vs[first].next].next].next ∈ rl1, ¬ vs0[vs[vs[first].next].next].next ∈ qrl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ first ∈ rl1, ¬ vs0[vs[vs[first].next].next].next ∈ rl, ¬ first ∈ rl, ¬ first ∈ qrl1, ¬ vs[vs[first].next].next ∈ qrl1, vs0[vs[vs[first].next].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vs[vs[first].next].next].next].val), vs[(vs0[vs[vs[first].next].next].next ' + qrl1).last].next ≠ null → vs0[(vs0[vs[vs[first].next].next].next ' + qrl1).last].next = vs[(vs0[vs[vs[first].next].next].next ' + qrl1).last].next ∧ vs0[vs0[(vs0[vs[vs[first].next].next].next ' + qrl1).last].next].val = vs[vs0[(vs0[vs[vs[first].next].next].next ' + qrl1).last].next].val, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r = vs0[vs[vs[first].next].next].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ (r0 = vs[vs[first].next].next ∨ r0 = vs0[vs[vs[first].next].next].next ∨ r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst = vs0[vs[vs[first].next].next].next ∨ lst ∈ qrl1, vtail = (vs0[vs[vs[first].next].next].next ' + qrl1).last ∨ vtail = (vs[vs[first].next].next ' + (vs0[vs[vs[first].next].next].next ' + qrl1).butlast).last ∧ vs[(vs0[vs[vs[first].next].next].next ' + qrl1).last].deqID = None ∧ vs[(vs0[vs[vs[first].next].next].next ' + qrl1).last].next = null, vtail0 = (qrl1 + rl).last ∨ vtail0 = (vs0[vs[vs[first].next].next].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl1 + rl, vtail1, rl0]

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl1 + rl, head, tail

Proof step 372 from proof stable-D20 (previous step) (back to tree)

ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), vs[vs0[ps[phead1].next].next].deqID = None, ps[vs0[ps[phead1].next].next].deqID = None, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, ps[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), qrl2 = phead2 + qrl, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, vs0[ps[phead1].next].next ≠ phead1, vs0[ps[phead1].next].next ≠ ps[phead1].next, ps[phead1].next ≠ null, first ≠ lst, first ≠ vs0[ps[phead1].next].next, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ first, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp((vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp(first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps), unmarkedp(rl, ps0), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs), phead1 ∈ ps, phead1 ∈ vs, ps[phead1].next ∈ ps0, ps[phead1].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl1 + rl), ¬ dups((rl1 + qrl2) + qrl1), ¬ dups(rl1), ¬ dups(qrl2 + qrl1 + rl), ¬ dups(rl1 + qrl2), ¬ dups(qrl1 + rl), ¬ dups(rl1 + qrl2 + qrl1), ¬ dups(rl), ¬ dups(qrl2), ¬ dups(qrl2 + qrl1), ¬ dups(qrl1), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ ps[phead1].next ∈ qrl1, ¬ first ∈ qrl1, ¬ first ∈ rl, ¬ vs0[ps[phead1].next].next ∈ rl, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl, ¬ phead1 ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ qrl1, ¬ vs0[ps[phead1].next].next ∈ qrl2, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ rl, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ≠ null → vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next = vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ∧ vs0[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val = vs[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val, (qrl1 + rl).head ≠ ps[first].next ∧ (qrl1 + rl).head ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → vs0[(qrl1 + rl).head].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → tid0 ≠ tid, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + qrl2 + phead1 ' + ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1) + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r = vs0[ps[phead1].next].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ (rl1 + first ' + qrl2 + phead1 ') + ps[phead1].next ' from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vtail = (vs0[ps[phead1].next].next ' + qrl1).last ∨ vtail = (ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1).butlast).last ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].deqID = None ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].next = null, vtail0 = ((vs0[ps[phead1].next].next ' + qrl1) + rl).last ∨ qrl1 + rl ≠ [] ∧ vtail0 = (vs0[ps[phead1].next].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst = vs0[ps[phead1].next].next ∨ lst ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next = vs0[ps[phead1].next].next ∨ vs[first].next ∈ qrl1 ⊦ (vs0[ps[phead1].next].next ≠ null → tid0 ≠ tid) ∧ (qrl1 + rl = [] ∨ vs0[(qrl1 + rl).head].deqID ≠ Some(tid))

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 ' + x).last = x.last; (s) ⊦ x.head ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ some?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 373 from proof stable-D20 (previous step) (back to tree)

vs0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps0[ps[phead1].next].deqID = vs0[ps[phead1].next].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs0[ps[phead1].next].next].deqID = Some(tid0), vs[vs0[ps[phead1].next].next].deqID = None, ps[vs0[ps[phead1].next].next].deqID = None, (qrl1 + rl).head = vs[first].next, ps[first].next = vs[first].next, ps0[ps[phead1].next].next = vs0[ps[phead1].next].next, ps0[first].next = vs[first].next, ps0[phead1].next = ps[phead1].next, ps[ps[phead1].next].next = vs0[ps[phead1].next].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, ps0[ps[phead1].next].val = vs0[ps[phead1].next].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns0(ps[phead1].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl1 + rl ≠ [], ps[vs[first].next].deqID ≠ None, ps[phead1].next ≠ vs[first].next, vs0[ps[phead1].next].next ≠ vs[first].next, ps[phead1].next ≠ null, vs0[ps[phead1].next].next ≠ ps[phead1].next, vs0[ps[phead1].next].next ≠ phead1, vs[first].next ≠ null, ps[phead1].next ≠ first, ps[phead1].next ≠ phead1, first ≠ vs[first].next, first ≠ null, first ≠ vs0[ps[phead1].next].next, first ≠ lst, phead ≠ ps[phead1].next, phead0 ≠ vs0[ps[phead1].next].next, phead1 ≠ vs[first].next, phead1 ≠ first, pretRefs0(tid) ≠ null, tid0 ≠ tid, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 + rl, vs0, ps0, owns0), listp((vs0[ps[phead1].next].next ' + qrl1) + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, ps, owns), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps), markedp(qrl, ps), markedp(rl1, vs), markedp(qrl, vs), markedp(rl1, ps0), markedp(qrl, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(vs[first].deqID), some?(ps0[vs0[ps[phead1].next].next].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps), unmarkedp(rl, ps0), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs), phead1 ∈ ps, phead1 ∈ vs, ps[phead1].next ∈ ps0, ps[phead1].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' + vs0[ps[phead1].next].next ' + qrl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl + qrl1 + rl), ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ dups(qrl + qrl1), ¬ dups(qrl1 + rl), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups(rl1 + qrl + qrl1), ¬ dups(rl1 + qrl + qrl1 + rl), ¬ weak?(vs0[ps[phead1].next].deqID), ¬ weak?(vs[first].deqID), ¬ ps[phead1].next ∈ qrl, ¬ vs0[ps[phead1].next].next ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ qrl, ¬ vs0[ps[phead1].next].next ∈ qrl1, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ first ∈ qrl, ¬ first ∈ rl1, ¬ vs0[ps[phead1].next].next ∈ rl, ¬ first ∈ rl, ¬ first ∈ qrl1, ¬ ps[phead1].next ∈ qrl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ ps[phead1].next ∈ rl, ¬ ps[phead1].next ∈ rl1, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs0[ps[phead1].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[ps[phead1].next].next].val), vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ≠ null → vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next = vs[(vs0[ps[phead1].next].next ' + qrl1).last].next ∧ vs0[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val = vs[vs0[(vs0[ps[phead1].next].next ' + qrl1).last].next].val, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl ∨ r0 = phead1 ∨ r0 = ps[phead1].next ∨ r0 = vs0[ps[phead1].next].next ∨ r0 ∈ qrl1 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl ∨ r = phead1 ∨ r = ps[phead1].next ∨ r = vs0[ps[phead1].next].next ∨ r ∈ qrl1 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + (vs[first].next ' + qrl) + phead1 ' + ps[phead1].next ' from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ rl, lst = vs[first].next ∨ lst ∈ qrl ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst = vs0[ps[phead1].next].next ∨ lst ∈ qrl1, vtail = (vs0[ps[phead1].next].next ' + qrl1).last ∨ vtail = (ps[phead1].next ' + (vs0[ps[phead1].next].next ' + qrl1).butlast).last ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].deqID = None ∧ vs[(vs0[ps[phead1].next].next ' + qrl1).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl ∨ phead = phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next, vtail0 = (qrl1 + rl).last ∨ vtail0 = (vs0[ps[phead1].next].next ' + (qrl1 + rl).butlast).last ∧ vs0[(qrl1 + rl).last].deqID = None ∧ vs0[(qrl1 + rl).last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl1 + rl, vtail1, rl0]

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl1 + rl, head, tail

Proof step 374 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + qrl2 + phead1 ' = rl3 + ps[phead1].next ' + qrl1.butlast, ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps[phead1].next = (ps[phead1].next ' + qrl1).last, ps0[first].next = ps[first].next, ps0[phead1].next = ps[phead1].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, ps[phead1].next ≠ phead1, ps[phead1].next ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead ≠ ps[phead1].next, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, qrl1 ≠ [], vtail1 ≠ phead1, vtail1 ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), listp((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, ps0, owns0), listp(ps[phead1].next ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, ps[phead1].next, vs0), noid(tid, (rl3 + ps[phead1].next ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + ps[phead1].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps0[ps[phead1].next].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + ps[phead1].next ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(qrl), ¬ dups(qrl2 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl2 + qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl), ¬ ps[phead1].next ∈ qrl2, ¬ ps[phead1].next ∈ rl1, ¬ ps[phead1].next ∈ qrl0, ¬ ps[phead1].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ qrl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl2, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl2, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(ps[phead1].next ' + qrl).last].next ≠ null → vs0[(ps[phead1].next ' + qrl).last].next = vs[(ps[phead1].next ' + qrl).last].next ∧ vs0[vs0[(ps[phead1].next ' + qrl).last].next].val = vs[vs0[(ps[phead1].next ' + qrl).last].next].val, vs0[ps[phead1].next].next ≠ ps[first].next ∧ vs0[ps[phead1].next].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid), vs0[ps[phead1].next].next ≠ null ∧ vs0[vs0[ps[phead1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[phead1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[phead1].next].next].deqID.tid, vs0[vs0[ps[phead1].next].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + ps[phead1].next ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = ps[phead1].next ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 ∈ rl3 ∨ phead1 ∈ ps[phead1].next ' + qrl1.butlast, vtail = (ps[phead1].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead1].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + ps[phead1].next ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = ps[phead1].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = ps[phead1].next ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = ps[phead1].next ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = ps[phead1].next ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[ps[phead1].next].next ≠ null → vs0[vs0[ps[phead1].next].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: bin-01: x ≠ [] ⊦ a ∈ x.butlast → a ∈ x; (forward) from specification list-last[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ y → a ∈ x + y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 375 from proof stable-D20 (previous step) (back to tree)

qrl + rl = vtail1 ' + qrl0, rl1 + first ' + qrl2 + phead1 ' = rl3 + qrl1.last ' + qrl1.butlast, qrl1.butlast = rl0 + phead1 ', ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps[phead1].next = qrl1.last, ps0[first].next = ps[first].next, ps0[phead1].next = qrl1.last, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[ps[first].next].deqID ≠ None, qrl1.last ≠ first, qrl1.last ≠ phead1, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead ≠ qrl1.last, phead0 ≠ vtail1, phead1 ≠ first, pretRefs0(tid) ≠ null, qrl1 ≠ [], vtail1 ≠ qrl1.last, vtail1 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl, vs, ps, owns), listp((rl3 + qrl1.last ' + qrl1) + qrl, vs, ps, owns), listp(rl1 + first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl + rl, vs0, ps0, owns0), listp(qrl1.last ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(qrl2, vs0), markedp(rl1, ps), markedp(qrl2, ps), markedp(rl1, vs), markedp(qrl2, vs), markedp(rl1, ps0), markedp(qrl2, ps0), nextnottid(tid, phead1, vs), nextnottidRely(tid, phead1, vs, qrl1.last, vs0), noid(tid, (rl3 + qrl1.last ' + qrl1) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + qrl1.last ' + qrl1) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[qrl1.last].deqID), some?(ps[qrl1.last].deqID), some?(vs[qrl1.last].deqID), some?(ps0[qrl1.last].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead1 ∈ qrl1.butlast, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + qrl1.last ' + qrl1) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl + rl from vtail, phead1 ∈ qrl1, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl2) + qrl), ¬ dups(rl), ¬ dups((rl1 + qrl2) + qrl0), ¬ dups(rl1), ¬ dups(qrl2 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(qrl0), ¬ dups(qrl2 + qrl), ¬ dups(qrl), ¬ dups(qrl2), ¬ phead1 ∈ qrl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl, ¬ first ∈ qrl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ qrl1.last ∈ qrl, ¬ qrl1.last ∈ qrl0, ¬ qrl1.last ∈ rl1, ¬ qrl1.last ∈ qrl2, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(qrl1.last ' + qrl).last].next ≠ null → vs0[(qrl1.last ' + qrl).last].next = vs[(qrl1.last ' + qrl).last].next ∧ vs0[vs0[(qrl1.last ' + qrl).last].next].val = vs[vs0[(qrl1.last ' + qrl).last].next].val, vs0[qrl1.last].next ≠ ps[first].next ∧ vs0[qrl1.last].next ∈ rl1 + first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl + rl from ps[first].next → vs0[vs0[qrl1.last].next].deqID ≠ Some(tid), vs0[qrl1.last].next ≠ null ∧ vs0[vs0[qrl1.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl1.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl1.last].next].deqID.tid, vs0[vs0[qrl1.last].next].val), qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ rl1 + first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl + rl from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ rl1 + first ' + ((qrl2 + phead1 ') + qrl1.last ') + qrl + rl from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl2 ∨ r = phead1 ∨ r = qrl1.last ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (qrl1.last ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl1.last ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl3 + qrl1.last ' + qrl1 from phead ∨ phead0 ∈ qrl0, vtail1 ∈ qrl ∨ vtail1 ∈ rl, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl2 ∨ lst = phead1 ∨ lst = qrl1.last ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl2 ∨ phead = phead1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl2 ∨ ps[first].next = phead1 ∨ ps[first].next = qrl1.last ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl2 ∨ vs[first].next = phead1 ∨ vs[first].next = qrl1.last ∨ vs[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl2 ∨ phead0 = phead1 ∨ phead0 = qrl1.last ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vs0[qrl1.last].next ≠ null → vs0[vs0[qrl1.last].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl1, lst0, y

Proof step 376 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl5 + vtail1 ' = rl3 + rl5.last ' + rl4, qrl + rl = (rl5 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl5 ≠ [], rl5.last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl5 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl5.last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, rl5.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), rl5.last ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl5), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl5 + qrl0), ¬ dups(rl2), ¬ dups(rl5), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl5), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl5) + qrl0), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl5, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl5, ¬ first ∈ qrl0, ¬ first ∈ qrl, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[rl5.last].next ≠ null ∧ vs0[vs0[rl5.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl5.last].next].deqID.tid)) = Claimed(vs0[vs0[rl5.last].next].deqID.tid, vs0[vs0[rl5.last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[rl5.last].next ≠ ps[first].next ∧ vs0[rl5.last].next ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[rl5.last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ ((rl1 + first ' + rl2) + rl5 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 ∈ qrl0, rl5.last ∈ rl1 ∨ rl5.last ∈ rl2 ∨ rl5.last ∈ rl5 ∨ rl5.last = vtail1, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail1 ∈ rl3 ∨ vtail1 = rl5.last ∨ vtail1 ∈ rl4 ⊦ (vs0[rl5.last].next ≠ null → vs0[vs0[rl5.last].next].deqID ≠ Some(tid)) ∧ (rl5.last ∈ rl2 ∨ rl5.last ∈ rl5 ∨ rl5.last = vtail1) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]

Proof step 377 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl5 + vtail1 ') + qrl0, rl1 + first ' + rl2 + rl5 = rl3 + rl5.last ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl5 ≠ [], rl5.last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl5 ≠ [], vtail1 ≠ rl5.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl5.last ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl5, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl5, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, rl5.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), rl5.last ∈ (rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups((rl2 + rl5) + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + rl5), ¬ dups(rl1 + rl2), ¬ dups(rl5), ¬ dups(rl2), ¬ dups(rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(rl1 + rl2 + rl5), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl5, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[rl5.last].next ≠ null ∧ vs0[vs0[rl5.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl5.last].next].deqID.tid)) = Claimed(vs0[vs0[rl5.last].next].deqID.tid, vs0[vs0[rl5.last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[rl5.last].next ≠ ps[first].next ∧ vs0[rl5.last].next ∈ (rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[rl5.last].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + rl5.last ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 ∈ qrl0, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vs0[rl5.last].next ≠ null → vs0[vs0[rl5.last].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [rl5, vhead0, rl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl5, vhead0, y

Proof step 378 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 + rl5 = rl3 + vhead0 ' + qrl1, qrl + rl = (rl5 + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl5 = rl0 + vhead0 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl5 ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl5 ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl5, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl5, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl5) + qrl0), ¬ dups((rl2 + rl5) + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + rl5), ¬ dups(rl1 + rl2), ¬ dups(rl5), ¬ dups(rl2), ¬ dups(rl5 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl5 + qrl0), ¬ dups(rl1 + rl2 + rl5), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl5, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl5, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl5 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl5, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 379 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + qrl0), ¬ dups((rl1 + rl2 + rl0) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 380 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + rl2 + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + qrl0), ¬ dups((rl1 + rl2 + rl0) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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

Proof step 381 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from first, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs) ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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, phead1, qrl2]

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, phead1, y

Proof step 382 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, vs0[ps[first].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + qrl2, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl ≠ [], vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from first, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (qrl ≠ [] → unmarkedp(qrl2, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (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); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s)

Proof step 383 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, (vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vtail1, vs[first].next ≠ null, first ≠ lst, first ≠ vtail1, first ≠ null, first ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp(vs[first].next ' + qrl2, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl2, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl2, vs), lst ∈ ps, lst ∈ vs, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from first, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst ∈ qrl2, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + rl0, vhead0, rl3 + vhead0 ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + rl0, vhead0, rl3 + vhead0 ' + qrl1

Proof step 384 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 385 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + rl0 = (rl3 + vhead0 ' + qrl1).butlast, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vhead0 = (rl3 + vhead0 ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + vhead0 ' + qrl1 ≠ [], vs[first].next ≠ vtail1, vs[first].next ≠ null, first ≠ lst, first ≠ vtail1, first ≠ null, first ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl2, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl2, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from first, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl2, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst ∈ qrl2 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 386 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + rl0 = rl3 + (vhead0 ' + qrl1).butlast, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vhead0 = (vhead0 ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vtail1, vs[first].next ≠ null, first ≠ lst, first ≠ vtail1, first ≠ null, first ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp(vs[first].next ' + qrl2, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl2, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl2, vs), lst ∈ ps, lst ∈ vs, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from first, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst ∈ qrl2, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vhead0 ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0 ', qrl1

Proof step 387 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 388 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 = rl3 + (vhead0 ' + qrl1).butlast, (vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), qrl1 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vhead0 = (vhead0 ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vtail1, vs[first].next ≠ null, first ≠ lst, first ≠ vtail1, first ≠ null, first ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl2, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl2, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from first, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl2, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst ∈ qrl2 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ [] + x = 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) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 389 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vs0[vhead0].next ') + qrl0, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps0[vhead0].deqID = vs0[vhead0].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[vhead0].next = vs0[vhead0].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, ps0[vhead0].val = vs0[vhead0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, owns0(vhead0) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vs0[vhead0].next, vs[first].next ≠ null, vs0[vhead0].next ≠ vhead0, first ≠ lst, first ≠ vs0[vhead0].next, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs0[vhead0].next, pretRefs0(tid) ≠ null, vhead0 ≠ first, vhead0 ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vs0[vhead0].next].deqID), some?(ps0[vs0[vhead0].next].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl2, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl2, vs), lst ∈ ps, lst ∈ vs, vtail0 ∈ (rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ vs0, vhead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2), ¬ weak?(vs[first].deqID), ¬ weak?(vs0[vhead0].deqID), ¬ first ∈ qrl0, ¬ vs0[vhead0].next ∈ rl0, ¬ vs0[vhead0].next ∈ qrl0, ¬ vs0[vhead0].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl2, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs0[vhead0].next ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs0[vhead0].next ≠ null → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), lst = vs[first].next ∨ lst ∈ qrl2, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vs0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs0[vs0[vhead0].next].deqID, tid0]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs0[vhead0].next].deqID, tid0

Proof step 390 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vs0[vhead0].next ') + qrl0, ps0[vhead0].deqID = vs0[vhead0].deqID, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs0[vhead0].next].deqID = Some(tid0), ps0[vhead0].next = vs0[vhead0].next, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps0[vhead0].val = vs0[vhead0].val, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns0(vhead0) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vs0[vhead0].next, vs[first].next ≠ null, vs0[vhead0].next ≠ vhead0, first ≠ lst, first ≠ vs0[vhead0].next, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs0[vhead0].next, pretRefs0(tid) ≠ null, vhead0 ≠ first, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp(vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(vs[first].deqID), some?(ps0[vs0[vhead0].next].deqID), some?(vs0[vs0[vhead0].next].deqID), unmarkedp(qrl2, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl2, ps), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0 from vtail, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl2), ¬ weak?(vs[first].deqID), ¬ weak?(vs0[vhead0].deqID), ¬ first ∈ qrl0, ¬ vs0[vhead0].next ∈ rl0, ¬ vs0[vhead0].next ∈ qrl0, ¬ vs0[vhead0].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl2, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl2, vs0[vhead0].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead0].next].val), vs0[vhead0].next ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vtail0 = (vs0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst ∈ qrl2 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ some?(Some(tid)); (s)

Proof step 391 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vs0[vhead0].next ') + qrl0, ps0[vhead0].deqID = vs0[vhead0].deqID, ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs0[vhead0].next].deqID = Some(tid0), ps0[vhead0].next = vs0[vhead0].next, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps0[vhead0].val = vs0[vhead0].val, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns0(vhead0) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vhead0].next ≠ vhead0, vs[first].next ≠ null, vs[first].next ≠ vs0[vhead0].next, first ≠ vs[first].next, first ≠ null, first ≠ vs0[vhead0].next, first ≠ lst, phead0 ≠ vs0[vhead0].next, pretRefs0(tid) ≠ null, vhead0 ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp(vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(vs[first].deqID), some?(ps0[vs0[vhead0].next].deqID), unmarkedp(qrl2, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl2, ps), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0 from vtail, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs0[vhead0].deqID), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl2, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl2, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead0].next ∈ rl1, ¬ vs0[vhead0].next ∈ qrl0, ¬ vs0[vhead0].next ∈ rl0, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead0].next].val), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → tid0 ≠ tid, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vtail0 = (vs0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst ∈ qrl2 ⊦ (vs0[vhead0].next ≠ null → tid0 ≠ tid) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl0

Additional information

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

Proof step 392 from proof stable-D20 (previous step) (back to tree)

(vs[first].next ' + qrl2) + rl = ((rl0 + vhead0 ') + vs0[vhead0].next ') + qrl0, vs0[vs0[vhead0].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps0[vhead0].deqID = vs0[vhead0].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[vhead0].next = vs0[vhead0].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, ps0[vhead0].val = vs0[vhead0].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, owns0(vhead0) = None, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vhead0].next ≠ vhead0, vs[first].next ≠ null, vs[first].next ≠ vs0[vhead0].next, first ≠ vs[first].next, first ≠ null, first ≠ vs0[vhead0].next, first ≠ lst, phead0 ≠ vs0[vhead0].next, pretRefs0(tid) ≠ null, vhead0 ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs((rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vs0[vhead0].next].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl2, ps), unmarkedp(qrl0, vs0), unmarkedp(qrl2, vs), lst ∈ ps, lst ∈ vs, vtail0 ∈ (rl1 + first ' + rl0) + vhead0 ' + vs0[vhead0].next ' + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ vs0, vhead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs0[vhead0].deqID), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl2, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl2, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ vs0[vhead0].next ∈ rl1, ¬ vs0[vhead0].next ∈ qrl0, ¬ vs0[vhead0].next ∈ rl0, ¬ first ∈ qrl0, vs0[vhead0].next ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → tid0 ≠ tid, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs0[vhead0].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vhead0].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ rl0 + vhead0 ' + vs0[vhead0].next ' + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), lst = vs[first].next ∨ lst ∈ qrl2, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vs0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vs[first].next ∈ qrl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ rl0, vs[first].next ∈ rl0 ∨ vs[first].next = vhead0 ∨ vs[first].next ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → tid0 ≠ tid) ∧ ps0[vs[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ some?(Some(tid)); (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] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ markedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 393 from proof stable-D20 (previous step) (back to tree)

qrl2 + rl = vs0[vs[first].next].next ' + qrl0, ps0[vs[first].next].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs0[vs[first].next].next].deqID = Some(tid0), vs0[qrl0.head].deqID = Some(tid), ps0[vs[first].next].next = vs0[vs[first].next].next, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps0[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = vs0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns0(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vs0[vs[first].next].next, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ null, first ≠ vs0[vs[first].next].next, first ≠ lst, phead0 ≠ vs0[vs[first].next].next, pretRefs0(tid) ≠ null, qrl0 ≠ [], tid0 ≠ tid, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(qrl2 + rl, vs0, ps0, owns0), listp(vs[first].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl2, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl2 + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vs[first].next, vs0), noid(tid, rl1 + first ' + vs[first].next ' + qrl2, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl2 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps0[vs0[vs[first].next].next].deqID), unmarkedp(qrl2, vs), unmarkedp(qrl0, vs0), unmarkedp(qrl2, ps), unmarkedp(qrl0, ps0), vs[first].next ∈ ps0, vs[first].next ∈ vs0, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + qrl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl2 + rl from vtail, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl2), ¬ dups(rl), ¬ dups(rl1 + qrl0), ¬ dups(rl1 + qrl2), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl2, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl2, ¬ first ∈ rl1, ¬ vs0[vs[first].next].next ∈ rl1, ¬ vs0[vs[first].next].next ∈ qrl0, ¬ first ∈ qrl0, vs0[vs[first].next].next ≠ null → rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[vs[first].next].next].val), vs[(vs[first].next ' + qrl2).last].next ≠ null → vs0[(vs[first].next ' + qrl2).last].next = vs[(vs[first].next ' + qrl2).last].next ∧ vs0[vs0[(vs[first].next ' + qrl2).last].next].val = vs[vs0[(vs[first].next ' + qrl2).last].next].val, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → vs0[vs[first].next].next = ps[vs[first].next].next, ∀ r0. r0 ≠ vs[first].next ∧ (r0 ∈ qrl2 ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ qrl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs0[vs[first].next].next ∈ qrl2 ∨ vs0[vs[first].next].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + qrl2).last ∨ vtail = (first ' + (vs[first].next ' + qrl2).butlast).last ∧ vs[(vs[first].next ' + qrl2).last].deqID = None ∧ vs[(vs[first].next ' + qrl2).last].next = null, lst = vs[first].next ∨ lst ∈ qrl2, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs[first].next ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next, vtail0 = (qrl2 + rl).last ∨ vtail0 = (vs0[vs[first].next].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl0.head ≠ vs[first].next ∧ (qrl0.head ∈ qrl2 ∨ qrl0.head ∈ rl)

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, vtail1, rl0]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (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] ⊦ None ≠ Some(tid); (s) ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 394 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + rl2 + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(tid), vs0[ps[first].next].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = first0 + rl4, rvowns(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ first, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + rl0) + qrl0), ¬ dups((rl1 + rl2 + rl0) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, qrl0.head ≠ ps[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vhead0].next ≠ ps[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ ps[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from ps[first].next → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ ps0[ps[first].next].deqID ≠ None ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 395 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + (vs[first].next ' + rl4) + rl0 + vhead0 ' = rl3 + vhead0 ' + qrl1, qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ vs[first].next, vhead0 ≠ first, vtail1 ≠ vs[first].next, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl4, vs), markedp(rl1, vs), markedp(rl4, ps), markedp(rl1, ps), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl4 + rl0), ¬ dups(rl0), ¬ dups(rl4), ¬ dups(qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + rl4), ¬ dups(rl4 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ weak?(vs[first].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + first ' + vs[first].next ' + rl4 + rl0, vhead0, rl3 + vhead0 ' + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + vs[first].next ' + rl4 + rl0, vhead0, rl3 + vhead0 ' + qrl1

Proof step 396 from proof stable-D20 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 397 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + vs[first].next ' + rl4 + rl0 = (rl3 + vhead0 ' + qrl1).butlast, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vhead0 = (rl3 + vhead0 ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + vhead0 ' + qrl1 ≠ [], ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ vs[first].next, vhead0 ≠ first, vtail1 ≠ vs[first].next, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl4, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl4, vs0), markedp(rl1, ps), markedp(rl4, ps), markedp(rl1, vs), markedp(rl4, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl4 + rl0), ¬ dups(rl0), ¬ dups(rl4), ¬ dups(qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + rl4), ¬ dups(rl4 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ weak?(vs[first].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ 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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 398 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + vs[first].next ' + rl4 + rl0 = rl3 + (vhead0 ' + qrl1).butlast, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vhead0 = (vhead0 ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vhead0 ≠ vs[first].next, vhead0 ≠ first, vtail1 ≠ vs[first].next, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl4, vs), markedp(rl1, vs), markedp(rl4, ps), markedp(rl1, ps), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl4 + rl0), ¬ dups(rl0), ¬ dups(rl4), ¬ dups(qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + rl4), ¬ dups(rl4 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ weak?(vs[first].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [vhead0 ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = 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) ⊦ [] + x = x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ x ≠ [] → (a ' + 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] ⊦ x.head ∈ x ↔ x ≠ []; (s) Used terms: vhead0 ', qrl1

Proof step 399 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 400 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' + rl4 + rl0 = rl3 + vhead0 ' + qrl1.butlast, qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vhead0 = (vhead0 ' + qrl1).last, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl1 ≠ [], vhead0 ≠ vs[first].next, vhead0 ≠ first, vtail1 ≠ vs[first].next, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl4, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl4, vs0), markedp(rl1, ps), markedp(rl4, ps), markedp(rl1, vs), markedp(rl4, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl4 + rl0), ¬ dups(rl0), ¬ dups(rl4), ¬ dups(qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + rl4), ¬ dups(rl4 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ weak?(vs[first].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ 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 → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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 ' + x).last = x.last; (s)

Proof step 401 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + vs[first].next ' + rl4 + rl0 = rl3 + qrl1.last ' + qrl1.butlast, qrl + rl = ((rl0 + qrl1.last ') + vtail1 ') + qrl0, vs0[vs[first].next].deqID = Some(tid), vs[vs[first].next].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, ps[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps0[first].val = vs0[first].val, vs[first].val = vs0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, ps[first].val = vs0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, qrl1.last ≠ first, qrl1.last ≠ vs[first].next, vs[first].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl1 ≠ [], vtail1 ≠ qrl1.last, vtail1 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(qrl1.last ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl4, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl4, vs0), markedp(rl1, ps), markedp(rl4, ps), markedp(rl1, vs), markedp(rl4, vs), nextnottidRely(tid, vhead, vs, qrl1.last, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[qrl1.last].deqID), some?(vs0[qrl1.last].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0 from vtail, qrl1.last ∈ (rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl4 + qrl), ¬ dups(rl1 + rl4), ¬ dups(qrl), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(qrl0), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(rl4 + rl0), ¬ weak?(vs[first].deqID), ¬ qrl1.last ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ qrl1.last ∈ qrl0, ¬ qrl1.last ∈ rl0, ¬ qrl1.last ∈ rl4, vs[vhead].next ≠ null ∧ vs[vs[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 → nextnottid(tid, vhead, vs), vs0[qrl1.last].next ≠ null ∧ vs0[vs0[qrl1.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl1.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl1.last].next].deqID.tid, vs0[vs0[qrl1.last].next].val), qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, vs0[qrl1.last].next ≠ vs[first].next ∧ vs0[qrl1.last].next ∈ (rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[qrl1.last].next].deqID ≠ Some(tid), vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + qrl1.last ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = qrl1.last ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = qrl1.last, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (vs0[qrl1.last].next ≠ null → vs0[vs0[qrl1.last].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

Heuristic use patterns 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] → [qrl1, vhead0, qrl2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl1, vhead0, y

Proof step 402 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + vtail1 ') + qrl0, rl1 + first ' + vs[first].next ' + rl4 + rl0 = rl3 + vhead0 ' + qrl2, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), qrl1 = qrl2 + vhead0 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, qrl1 ≠ [], vhead0 ≠ first, vhead0 ≠ vs[first].next, vtail1 ≠ vhead0, vtail1 ≠ vs[first].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(vhead0 ' + (qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl4, vs), markedp(rl1, vs), markedp(rl4, ps), markedp(rl1, ps), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl4 + qrl), ¬ dups(rl1 + rl4), ¬ dups(qrl), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(qrl0), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(rl4 + rl0), ¬ weak?(vs[first].deqID), ¬ vhead0 ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl1, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl4, ¬ vtail1 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl4, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + qrl1 + vtail1 ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ x + a ' ≠ []; (s)

Proof step 403 from proof stable-D20 (previous step) (back to tree)

qrl + rl = ((rl0 + vhead0 ') + ps0[vhead0].next ') + qrl0, rl1 + first ' + vs[first].next ' + rl4 + rl0 = rl3 + vhead0 ' + qrl2, ps0[vs[first].next].deqID = ps[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid), vs0[vs[first].next].deqID = Some(tid), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = vs0[first].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, vs[first].val = vs0[first].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[vs[first].next].deqID ≠ None, ps0[vhead0].next ≠ vs[first].next, ps0[vhead0].next ≠ vhead0, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ ps0[vhead0].next, phead0 ≠ ps0[vhead0].next, pretRefs0(tid) ≠ null, vhead0 ≠ vs[first].next, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, ps, owns), listp(vs[first].next ' + rl4 + qrl, vs, ps, owns), listp(vhead0 ' + ((qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), markedp(rl4, vs), markedp(rl1, vs), markedp(rl4, ps), markedp(rl1, ps), markedp(rl4, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs[first].next, vs), nonullRetRefs((rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vs[first].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs[first].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl4 + rl0), ¬ dups(rl0), ¬ dups(rl4), ¬ dups(qrl0), ¬ dups(rl1 + rl4 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl4 + rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1 + rl4), ¬ dups(rl4 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl4 + qrl), ¬ dups(rl1 + rl4 + rl0 + qrl0), ¬ weak?(vs[first].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ ps0[vhead0].next ∈ rl0, ¬ ps0[vhead0].next ∈ rl4, ¬ ps0[vhead0].next ∈ qrl0, ¬ ps0[vhead0].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl4, ¬ first ∈ rl0, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl4, ¬ vs[first].next ∈ rl1, ¬ vhead0 ∈ rl1, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, vs0[vhead0].next ≠ vs[first].next ∧ vs0[vhead0].next ∈ (rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vs[first].next → vs0[vs0[vhead0].next].deqID ≠ Some(tid), vs[(vs[first].next ' + rl4 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl4 + qrl).last].next = vs[(vs[first].next ' + rl4 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl4 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl4 + qrl).last].next].val, qrl0.head ≠ vs[first].next ∧ qrl0.head ∈ (rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vs[first].next → vs0[qrl0.head].deqID ≠ Some(tid), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[first].next ∧ r0 ∈ (rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vs[first].next → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl4 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl4 ∨ phead0 ∈ rl0 ∨ phead0 = vhead0, (vs[first].next ' + rl4).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl4).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl4).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl4 ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl4 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl4 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead = vs[first].next ∨ vhead ∈ rl4, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl4, phead0 ∈ rl1 + first ' + vs[first].next ' + rl4 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ (vs0[vhead0].next ≠ null → vs0[vs0[vhead0].next].deqID ≠ Some(tid)) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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:[rl, vs, ps, owns] → [(rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0]

Additional information

Used simplifier rules: ⊦ dups(x + a ' + y + a ' + z); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (rl3 + vhead0 ' + (qrl2 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0

Proof step 404 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 405 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), ¬ success, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Pending(tid) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Pending(tid) ↔ true); (ss)

Proof step 406 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noidRely-def, seq:⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)), subst:[rl, tid, vs0, rl0, vs] → [(rl1 + first ' + rl2) + qrl, tid, vs0, (rl3 + vhead0 ' + rl4) + qrl0, vs], <all paths>

Additional information

Used terms: (rl1 + first ' + rl2) + qrl, tid, vs0, (rl3 + vhead0 ' + rl4) + qrl0, vs

Proof step 407 from proof stable-D20 (previous step) (back to tree)

⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))

A spec-lemma

Proof step 408 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. noid(tid, (rl1 + first ' + rl2) + qrl, r, vs) → noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, r, vs0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 107 terms: first abort: F discard: T computed: T

Additional information

Used terms: first

Proof step 409 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) → noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

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]

Proof step 410 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0], <all paths>

Additional information

Used terms: tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0

Proof step 411 from proof stable-D20 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 412 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 413 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ nextnottid(tid, vhead0, vs0), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ∧ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0); (ss)

Proof step 414 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ nextnottid(tid, first, vs), ¬ nextnottid(tid, vhead0, vs0), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), vhead0 ∈ rl1 ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:nextnottid-def, seq:⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), subst:[tid, vhead, vs] → [tid, first, vs], <all paths>

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) ⊦ Pending(tid) ≠ Claimed(tid0, val); (s) Used terms: tid, first, vs

Proof step 415 from proof stable-D20 (previous step) (back to tree)

⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)

A spec-lemma

Proof step 416 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 417 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1, vhead0 ∈ vs, vhead0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0], <all paths>

Additional information

Used terms: rl2, rl0

Proof step 418 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 419 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead0 ∈ ps, vhead0 ∈ vs, vhead0 ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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

Proof step 420 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl + rl, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + rl4) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vhead0 ∈ ps, vhead0 ∈ vs, vhead0 ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vhead0 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl + rl from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vhead0 ∈ rl2, ¬ first ∈ rl, vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead0 ∈ rl3 + vhead0 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, rl2.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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, vtail1, qrl0]

Additional information

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

Proof step 421 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + vhead0 ' + rl4, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = qrl0 + vtail1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl + rl, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl3 + vhead0 ' + rl4) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl + rl from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vhead0 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1, vhead0 ∈ vs, vhead0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vhead0 ∈ rl2, ¬ first ∈ rl, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), vtail1 = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + qrl0).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl3 + vhead0 ' + rl4 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) 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; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 422 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + qrl0 + vtail1 ' = rl3 + (first ' + qrl0).last ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, (first ' + qrl0).last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + (qrl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((first ' + qrl0).last ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), markedp(qrl0, vs), nextnottidRely(tid, vhead, vs, (first ' + qrl0).last, vs0), noid(tid, (rl1 + first ' + qrl0 + vtail1 ') + qrl, first, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl1 + first ' + qrl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), (first ' + qrl0).last ∈ ps, (first ' + qrl0).last ∈ vs, (first ' + qrl0).last ∈ ps0, (first ' + qrl0).last ∈ vs0, (first ' + qrl0).last ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + qrl0 + vtail1 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl1 + first ' + qrl0 + vtail1 ') + qrl + rl from vtail, (first ' + qrl0).last ∈ (rl1 + first ' + qrl0 + vtail1 ') + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl + rl), ¬ dups(rl), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1 + qrl0 + qrl), ¬ first ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl1, ¬ (first ' + qrl0).last ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(first ' + qrl0).last].next ≠ null ∧ vs0[vs0[(first ' + qrl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl0).last].next].deqID.tid, vs0[vs0[(first ' + qrl0).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ (r0 ∈ qrl0 ∨ r0 = vtail1 ∨ r0 ∈ qrl ∨ r0 ∈ rl) → vs0[r0].deqID ≠ Some(tid), vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = vtail1, vhead = first ∨ vhead ∈ qrl0 ∨ vhead = vtail1, lst ∈ qrl0 ∨ lst = vtail1 ∨ lst ∈ qrl, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + qrl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl1 + first ' + qrl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, vtail1 ∈ rl3 ∨ vtail1 ∈ rl4 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', qrl0

Proof step 423 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 424 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead0 ∈ ps, vhead0 ∈ vs, vhead0 ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s)

Proof step 425 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1, vhead0 ∈ vs, vhead0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ 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), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl2 + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] → [rl0, phead1, qrl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, phead1, y

Proof step 426 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = qrl1 + phead1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead0 ∈ ps, vhead0 ∈ vs, vhead0 ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl2 + qrl1).last = vhead0 ∧ phead0 ≠ phead1 ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) 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; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 427 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + qrl1 + phead1 ' = rl3 + (first ' + rl2 + qrl1).last ' + rl4, qrl + rl = (qrl1 + phead1 ') + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, (first ' + rl2 + qrl1).last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead0 ≠ phead1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((first ' + rl2 + qrl1).last ' + rl4 + qrl0, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(qrl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(qrl1, ps0), nextnottidRely(tid, vhead, vs, (first ' + rl2 + qrl1).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs(((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (first ' + rl2 + qrl1).last ∈ ps0, (first ' + rl2 + qrl1).last ∈ vs0, (first ' + rl2 + qrl1).last ∈ ps, (first ' + rl2 + qrl1).last ∈ vs, (first ' + rl2 + qrl1).last ∈ ((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, (first ' + rl2 + qrl1).last ∈ rl1, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + qrl1) + qrl0), ¬ dups((rl2 + qrl1) + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(qrl1 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + qrl1 + qrl0), ¬ dups(rl1 + rl2 + qrl1), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ (first ' + rl2 + qrl1).last ∈ rl2, ¬ (first ' + rl2 + qrl1).last ∈ qrl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl1, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + rl2 + qrl1).last].next ≠ null ∧ vs0[vs0[(first ' + rl2 + qrl1).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2 + qrl1).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2 + qrl1).last].next].deqID.tid, vs0[vs0[(first ' + rl2 + qrl1).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ (r0 ∈ rl2 ∨ r0 ∈ qrl1 ∨ r0 = phead1 ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ 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), 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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail0 = (phead1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ qrl0, phead1 ∈ rl3 ∨ phead1 ∈ rl4 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first ', rl2 + qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', rl2 + qrl1

Proof step 428 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 429 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (qrl1 + phead1 ') + qrl0, (rl1 + first ' + rl2) + qrl1 + phead1 ' = rl3 + (rl2 + qrl1).last ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl1 ≠ [], vs[ps[first].next].deqID ≠ None, (rl2 + qrl1).last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, phead0 ≠ phead1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0, vs0, ps0, owns0), listp((rl2 + qrl1).last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(qrl1, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (rl2 + qrl1).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (rl2 + qrl1).last ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0 from vtail, (rl2 + qrl1).last ∈ ((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0 from vhead, (rl2 + qrl1).last ∈ vs, (rl2 + qrl1).last ∈ ps, (rl2 + qrl1).last ∈ vs0, (rl2 + qrl1).last ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + qrl1) + qrl0), ¬ dups((rl2 + qrl1) + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(qrl1 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + qrl1 + qrl0), ¬ dups(rl1 + rl2 + qrl1), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl1, ¬ (rl2 + qrl1).last ∈ rl2, ¬ (rl2 + qrl1).last ∈ qrl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl1, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(rl2 + qrl1).last].next ≠ null ∧ vs0[vs0[(rl2 + qrl1).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + qrl1).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + qrl1).last].next].deqID.tid, vs0[vs0[(rl2 + qrl1).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ (r0 ∈ rl2 ∨ r0 ∈ qrl1 ∨ r0 = phead1 ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead1 ∈ rl3 ∨ phead1 ∈ rl4, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl1, vtail0 = (phead1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]

Proof step 430 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (qrl1 + phead1 ') + qrl0, (rl1 + first ' + rl2) + qrl1 + phead1 ' = rl3 + (rl2 + qrl1).last ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + qrl1 ≠ [], vs[ps[first].next].deqID ≠ None, (rl2 + qrl1).last ≠ first, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, phead0 ≠ phead1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0, vs0, ps0, owns0), listp((rl2 + qrl1).last ' + rl4 + qrl0, vs0, ps0, owns0), markedp(qrl1, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(qrl1, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (rl2 + qrl1).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (rl2 + qrl1).last ∈ ps, (rl2 + qrl1).last ∈ vs, (rl2 + qrl1).last ∈ ps0, (rl2 + qrl1).last ∈ vs0, (rl2 + qrl1).last ∈ rl1, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0 from vtail, (rl2 + qrl1).last ∈ ((rl1 + first ' + rl2) + qrl1 + phead1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl1), ¬ dups(rl2 + qrl1 + qrl0), ¬ dups(qrl0), ¬ dups(qrl1 + qrl0), ¬ dups(rl2), ¬ dups(qrl1), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl1), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + qrl1) + qrl0), ¬ dups((rl1 + rl2 + qrl1) + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ qrl1, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ (rl2 + qrl1).last ∈ qrl1, ¬ (rl2 + qrl1).last ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ rl2, ¬ phead1 ∈ qrl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(rl2 + qrl1).last].next ≠ null ∧ vs0[vs0[(rl2 + qrl1).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + qrl1).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + qrl1).last].next].deqID.tid, vs0[vs0[(rl2 + qrl1).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ (r0 ∈ rl2 ∨ r0 ∈ qrl1 ∨ r0 = phead1 ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl1, vtail0 = (phead1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead1 ∈ rl3 ∨ phead1 ∈ rl4 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl2, qrl1

Proof step 431 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 432 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[qrl0.head].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 433 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[qrl0.head].deqID = Some(tid), ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, (rl2 + rl0).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = qrl0.last ∨ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, phead1, qrl1]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 434 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl0 = phead1 + qrl1, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r0. r0 ≠ first ∧ r0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = qrl0.last ∨ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ unmarkedp(qrl1, vs0) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 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] ⊦ a + x = 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; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)

Proof step 435 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + (rl2 + rl0).last ' + rl4, qrl + rl = rl0 + phead1 ' + qrl1, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[phead1].deqID = Some(tid), ps0[phead1].deqID = None, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl2 + rl0).last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, (rl2 + rl0).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs(rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps0), unmarkedp(qrl, ps), (rl2 + rl0).last ∈ rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1 from vhead, vtail0 ∈ rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl0) + qrl1), ¬ dups((rl2 + rl0) + qrl1), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl0 + qrl1), ¬ dups(rl2 + rl0), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0), ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(rl2 + rl0).last].next ≠ null ∧ vs0[vs0[(rl2 + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl0).last].next].deqID.tid, vs0[vs0[(rl2 + rl0).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (rl2 + rl0 + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (rl2 + rl0).last ∈ rl1 ∨ (rl2 + rl0).last = first ∨ (rl2 + rl0).last ∈ rl2 ∨ (rl2 + rl0).last ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0], <all paths>

Additional information

Used terms: rl2, rl0

Proof step 436 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 437 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + phead1 ' + qrl1, (rl1 + first ' + rl2) + rl0 = rl3 + (rl2 + rl0).last ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp((rl2 + rl0).last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1 from vtail, (rl2 + rl0).last ∈ rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl0) + qrl1), ¬ dups((rl2 + rl0) + qrl1), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl0 + qrl1), ¬ dups(rl2 + rl0), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0), ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(rl2 + rl0).last].next ≠ null ∧ vs0[vs0[(rl2 + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl0).last].next].deqID.tid, vs0[vs0[(rl2 + rl0).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + (rl2 + rl0).last ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, (rl2 + rl0).last ∈ rl1 ∨ (rl2 + rl0).last = first ∨ (rl2 + rl0).last ∈ rl2 ∨ (rl2 + rl0).last ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (rl2 + rl0 + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ ¬ a ∈ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 438 from proof stable-D20 (previous step) (back to tree)

qrl + rl = phead1 ' + qrl1, rl1 + first ' + rl2 = rl3 + rl2.last ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + rl2.last ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl2.last ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, rl2.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + rl2.last ' + rl4 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + rl2.last ' + rl4 + qrl + rl from vtail, rl2.last ∈ rl3 + rl2.last ' + rl4 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl1), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + qrl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, vs0[rl2.last].next ≠ null ∧ vs0[vs0[rl2.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl2.last].next].deqID.tid)) = Claimed(vs0[vs0[rl2.last].next].deqID.tid, vs0[vs0[rl2.last].next].val), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + rl2.last ' + rl4 + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail0 = (qrl + rl).last ∨ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead1 ∈ qrl ∨ phead1 ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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, vtail1, rl0]

Additional information

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

Proof step 439 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl2 = rl3 + vtail1 ' + rl4, qrl + rl = phead1 ' + qrl1, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[phead1].deqID = Some(tid), ps0[phead1].deqID = None, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = rl0 + vtail1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), listp(vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps0), unmarkedp(qrl, ps), vtail1 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vhead, vtail0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl1), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + qrl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl1, vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), phead1 ∈ qrl ∨ phead1 ∈ rl, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail0 = (qrl + rl).last ∨ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 = phead1 ∨ phead0 ∈ qrl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 440 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = phead1 ' + qrl1, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[phead1].deqID = Some(tid), ps0[phead1].deqID = None, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ phead1, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (rl0 + vtail1 ') + qrl, vs, ps, owns), listp(vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl3 + vtail1 ' + rl4) + qrl, first, vs), nonullRetRefs(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps0), unmarkedp(qrl, ps), vtail1 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vhead, vtail0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vtail1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl1), ¬ dups(rl0 + qrl1), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups((rl1 + rl0) + qrl1), ¬ phead1 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl, lst ∈ rl0 ∨ lst = vtail1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl0 ∨ vhead = vtail1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vtail1, vtail0 = (qrl + rl).last ∨ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vtail1, phead1 ∈ qrl ∨ phead1 ∈ rl, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + vtail1 ' + rl4 from phead ∨ phead0 = phead1 ∨ phead0 ∈ qrl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 116 terms: phead1 abort: F discard: F computed: T

Additional information

Used terms: phead1

Proof step 441 from proof stable-D20 (previous step) (back to tree)

qrl + rl = phead1 ' + qrl1, rl1 + first ' + rl0 + vtail1 ' = rl3 + vtail1 ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ phead1, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(first ' + (rl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl3 + vtail1 ' + rl4) + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps), markedp(rl0, ps), markedp(rl1, vs), markedp(rl0, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl3 + vtail1 ' + rl4) + qrl, first, vs), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl3 + vtail1 ' + rl4) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vtail, vtail1 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl1), ¬ dups(rl0 + qrl1), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups((rl1 + rl0) + qrl1), ¬ phead1 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, phead1 ≠ first ∧ phead1 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from first → vs0[phead1].deqID ≠ Some(tid), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl3 + vtail1 ' + rl4 from phead ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), phead1 ∈ qrl ∨ phead1 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vtail1, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (qrl + rl).last ∨ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vtail1, vhead = first ∨ vhead ∈ rl0 ∨ vhead = vtail1, lst ∈ rl0 ∨ lst = vtail1 ∨ lst ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 442 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = phead1 ' + qrl1, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[phead1].deqID = Some(tid), ps0[phead1].deqID = None, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, first ≠ phead1, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl3 + vtail1 ' + rl4) + qrl, vs, ps, owns), listp(first ' + (rl0 + vtail1 ') + qrl, vs, ps, owns), listp(vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, ps0, owns0), markedp(rl0, vs), markedp(rl1, vs), markedp(rl0, ps), markedp(rl1, ps), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl3 + vtail1 ' + rl4) + qrl, first, vs), nonullRetRefs(rl3 + vtail1 ' + rl4 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl3 + vtail1 ' + rl4) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps0), unmarkedp(qrl, ps), vtail1 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vhead, vtail0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl3 + vtail1 ' + rl4) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl1), ¬ dups(rl0 + qrl1), ¬ dups(qrl), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl0) + qrl), ¬ dups((rl1 + rl0) + qrl1), ¬ phead1 ∈ rl0, ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ rl1, ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from first, vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + qrl + rl from first → vs0[r0].deqID ≠ Some(tid), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl, lst ∈ rl0 ∨ lst = vtail1 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl0 ∨ vhead = vtail1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl0 ∨ phead = vtail1, vtail0 = (qrl + rl).last ∨ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 = vtail1, phead1 ∈ qrl ∨ phead1 ∈ rl, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl0).last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), phead0 ∈ rl3 + vtail1 ' + rl4 from phead ∨ phead0 = phead1 ∨ phead0 ∈ qrl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl3, vtail1 ' + rl4 + qrl + rl, first], <all paths>

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ y ∧ ¬ b ∈ x → (x + a ' + z = y + b ' + y0 ↔ a = b ∧ x = y ∧ z = y0); (ws) Used terms: rl3, vtail1 ' + rl4 + qrl + rl, first

Proof step 443 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 444 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + phead1 ' + qrl1, (rl1 + first ' + rl2) + rl0 = rl3 + rl0.last ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + rl0.last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(rl0.last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, rl0.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + rl0.last ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + rl0.last ' + rl4 + phead1 ' + qrl1 from vtail, rl0.last ∈ rl3 + rl0.last ' + rl4 + phead1 ' + qrl1 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl0) + qrl1), ¬ dups((rl2 + rl0) + qrl1), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl0 + qrl1), ¬ dups(rl2 + rl0), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0), ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + rl0.last ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, rl0.last ∈ rl1 ∨ rl0.last = first ∨ rl0.last ∈ rl2 ∨ rl0.last ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (rl2 + rl0 + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 445 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + rl0.last ' + rl4, qrl + rl = rl0 + phead1 ' + qrl1, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[phead1].deqID = Some(tid), ps0[phead1].deqID = None, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), listp(rl0.last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(rl3 + rl0.last ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, rl0.last, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs(rl3 + rl0.last ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps0), unmarkedp(qrl, ps), rl0.last ∈ rl3 + rl0.last ' + rl4 + phead1 ' + qrl1 from vhead, vtail0 ∈ rl3 + rl0.last ' + rl4 + phead1 ' + qrl1 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl0) + qrl1), ¬ dups((rl2 + rl0) + qrl1), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl0 + qrl1), ¬ dups(rl2 + rl0), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0), ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + rl0.last ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (rl0 + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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] → [rl0, vtail1, qrl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y

Proof step 446 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + phead1 ' + qrl1, (rl1 + first ' + rl2) + rl0 = rl3 + vtail1 ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = qrl0 + vtail1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vtail, vtail1 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl0) + qrl1), ¬ dups((rl2 + rl0) + qrl1), ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl0 + qrl1), ¬ dups(rl2 + rl0), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0), ¬ phead1 ∈ qrl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl1, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (rl0 + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 447 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (qrl0 + vtail1 ') + phead1 ' + qrl1, (rl1 + first ' + rl2) + qrl0 + vtail1 ' = rl3 + vtail1 ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ phead1, first ≠ lst, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vtail, vtail1 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2 + qrl0 + qrl1), ¬ dups(qrl0 + qrl1), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + qrl0) + qrl1), ¬ dups((rl1 + rl2 + qrl0) + qrl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl1, ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ qrl, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl0 ∨ phead0 = vtail1 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (vtail1 ' + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl0 ∨ phead0 = vtail1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic quantifier closing applied rule all left

And obtained the following new goals

Rule argument

pos: left 123 terms: phead1

Additional information

Used terms: phead1

Proof step 448 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + qrl0 + vtail1 ' = rl3 + vtail1 ' + rl4, qrl + rl = (qrl0 + vtail1 ') + phead1 ' + qrl1, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs0[phead1].deqID = Some(tid), ps0[phead1].deqID = None, ps0[first].next = ps[first].next, ps[ps[first].next].val = ps0[ps[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ phead1, first ≠ lst, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), listp(vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(qrl0, ps0), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl1, vs0), unmarkedp(qrl1, ps0), unmarkedp(qrl, ps), vtail1 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vhead, vtail0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2 + qrl0 + qrl1), ¬ dups(qrl0 + qrl1), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + qrl0) + qrl1), ¬ dups((rl1 + rl2 + qrl0) + qrl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl1, ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ qrl, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, phead1 ≠ first ∧ phead1 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from first → vs0[phead1].deqID ≠ Some(tid), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl0 ∨ phead0 = vtail1, vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (vtail1 ' + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl0 ∨ phead0 = vtail1 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 449 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (qrl0 + vtail1 ') + phead1 ' + qrl1, (rl1 + first ' + rl2) + qrl0 + vtail1 ' = rl3 + vtail1 ' + rl4, ps0[phead1].deqID = None, vs0[phead1].deqID = Some(tid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, vs0[ps[first].next].deqID = vs[ps[first].next].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, vs[ps[first].next].val = vs0[ps[first].next].val, ps[ps[first].next].val = ps0[ps[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ vtail1, first ≠ phead1, first ≠ lst, phead1 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(vtail1 ' + rl4 + phead1 ' + qrl1, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(qrl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vtail1, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl3 + vtail1 ' + rl4 + phead1 ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl1, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vtail, vtail1 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2 + qrl0 + qrl1), ¬ dups(qrl0 + qrl1), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups((rl2 + qrl0) + qrl1), ¬ dups((rl1 + rl2 + qrl0) + qrl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl1, ¬ vtail1 ∈ qrl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl1, ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ phead1 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from first, ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID, vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next, ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vtail1].next ≠ null ∧ vs0[vs0[vtail1].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail1].next].deqID.tid)) = Claimed(vs0[vs0[vtail1].next].deqID.tid, vs0[vs0[vtail1].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ first ∧ r0 ∈ rl3 + vtail1 ' + rl4 + phead1 ' + qrl1 from first → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl0 ∨ phead0 = vtail1 ∨ phead0 = phead1 ∨ phead0 ∈ qrl1, vtail0 = (phead1 ' + qrl1).last ∨ vtail0 = (vtail1 ' + (phead1 ' + qrl1).butlast).last ∧ vs0[(phead1 ' + qrl1).last].deqID = None ∧ vs0[(phead1 ' + qrl1).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl0 ∨ phead0 = vtail1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl3, vtail1 ' + rl4 + phead1 ' + qrl1, first], <all paths>

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ y ∧ ¬ b ∈ x → (x + a ' + z = y + b ' + y0 ↔ a = b ∧ x = y ∧ z = y0); (ws) Used terms: rl3, vtail1 ' + rl4 + phead1 ' + qrl1, first

Proof step 450 from proof stable-D20 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 451 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 452 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[vs[first].next].val = ps0[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x ≠ []; (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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 453 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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

Proof step 454 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[vs[first].next].val = ps0[vs[first].next].val, vs[vs[first].next].val = vs0[vs[first].next].val, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl0 + qrl0), ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ ps[first].next ∈ qrl, ¬ ps[first].next ∈ rl1, vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → success, ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next, vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID, vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs0[vs[first].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ noid(tid, rl1 + first ' + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl, (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ 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) ⊦ 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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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, phead1, y

Proof step 455 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 456 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ 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), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x ≠ []; (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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 457 from proof stable-D20 (previous step) (back to tree)

(rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vhead, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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

Proof step 458 from proof stable-D20 (previous step) (back to tree)

rl1 + first ' + rl0 = rl3 + vhead0 ' + rl4, qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), listp((rl3 + vhead0 ' + rl4) + qrl0, vs0, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, first, vs, vhead0, vs0), noidRely(tid, rl1 + first ' + qrl, vs, (rl3 + vhead0 ' + rl4) + qrl0, vs0), nonullRetRefs((rl3 + vhead0 ' + rl4) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vhead0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from first, vtail0 ∈ (rl3 + vhead0 ' + rl4) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl0 + qrl0), ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → success, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ noid(tid, rl1 + first ' + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, rl1 + first ' + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl0, (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs) ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, (rl3 + vhead0 ' + rl4) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

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

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ 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) ⊦ 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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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, phead1, y

Proof step 459 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vhead0 ∈ rl1 ∨ vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 → (rl1 + first ' + rl2) + rl0 = rl3 + vhead0 ' + rl4 ∧ listp(vhead0 ' + rl4 + qrl0, vs0, ps0, owns0), ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0)) ∧ (vhead0 = first ∨ vhead0 ∈ rl2 ∨ vhead0 ∈ rl0) ∧ (success ⊃ vs0[ps[first].next].deqID = Some(tid) ∧ rvowns0(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0) ;vs0[ps[first].next].deqID ≠ None ∧ noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, first, vs0) ∧ rvowns0(pretRefs0(tid)) = Pending(tid) ) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first ∧ success) ∧ vs[ps[first].next].val = vs0[ps[first].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 460 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first ', rl2 + rl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: first ', rl2 + rl0

Proof step 461 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 462 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (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, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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 ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 463 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0], <all paths>

Additional information

Used terms: rl2, rl0

Proof step 464 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 465 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = [], vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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

Proof step 466 from proof stable-D20 (previous step) (back to tree)

ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl, vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, rl2.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 92

Additional information

Proof step 467 from proof stable-D20 (previous step) (back to tree)

vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, rl2.last = vhead, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, rl2.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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)

Proof step 468 from proof stable-D20 (previous step) (back to tree)

vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2.last ≠ first, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, rl2.last, vs), nextnottidRely(tid, rl2.last, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from rl2.last, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[rl2.last].next ≠ null ∧ vs[vs[rl2.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl2.last].next].deqID.tid)) = Claimed(vs[vs[rl2.last].next].deqID.tid, vs[vs[rl2.last].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ ps[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, rl2.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns 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, vtail1, qrl0]

Additional information

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

Proof step 469 from proof stable-D20 (previous step) (back to tree)

ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = qrl0 + vtail1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vtail1, vs), nextnottidRely(tid, vtail1, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail1, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(qrl), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, vs[vtail1].next ≠ null ∧ vs[vs[vtail1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail1].next].deqID.tid)) = Claimed(vs[vs[vtail1].next].deqID.tid, vs[vs[vtail1].next].val), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ ps[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail1 = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + qrl0).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 470 from proof stable-D20 (previous step) (back to tree)

ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + qrl0).last ≠ vtail1, (first ' + qrl0).last ≠ first, ps[first].next ≠ null, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, vtail1 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + vtail1 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs0), markedp(rl1, vs0), markedp(qrl0, ps0), markedp(rl1, ps0), nextnottid(tid, vtail1, vs), nextnottidRely(tid, vtail1, vs, (first ' + qrl0).last, vs0), noidRely(tid, (rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + qrl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ rl1 + first ' + (qrl0 + vtail1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + vtail1 ') + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1 + qrl0 + qrl), ¬ dups(qrl + rl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl + rl), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + qrl + rl), ¬ dups((rl1 + qrl0) + qrl), ¬ (first ' + qrl0).last ∈ qrl0, ¬ (first ' + qrl0).last ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ rl1, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl0, vs[first].next ∈ rl1 ∨ vs[first].next ∈ qrl0 ∨ vs[first].next = vtail1 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), ps[first].next ∈ rl1 ∨ ps[first].next ∈ qrl0 ∨ ps[first].next = vtail1 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(vtail1 ' + qrl).last].next ≠ null → vs0[(vtail1 ' + qrl).last].next = vs[(vtail1 ' + qrl).last].next ∧ vs0[vs0[(vtail1 ' + qrl).last].next].val = vs[vs0[(vtail1 ' + qrl).last].next].val, vs[vtail1].next ≠ null ∧ vs[vs[vtail1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail1].next].deqID.tid)) = Claimed(vs[vs[vtail1].next].deqID.tid, vs[vs[vtail1].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + qrl0).last].next ≠ null ∧ vs0[vs0[(first ' + qrl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl0).last].next].deqID.tid, vs0[vs0[(first ' + qrl0).last].next].val), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ ps[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + qrl0 + vtail1 ') + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + qrl0 + vtail1 ') + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ qrl0 ∨ r = vtail1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (first ' + qrl0).last ∈ qrl ∨ (first ' + qrl0).last ∈ rl, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, lst ∈ qrl0 ∨ lst = vtail1 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = vtail1, phead0 ∈ rl1 + first ' + qrl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', qrl0

Proof step 471 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 472 from proof stable-D20 (previous step) (back to tree)

vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, (first ' + rl2.butlast).last = vhead, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ rl2.last, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, rl2.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 473 from proof stable-D20 (previous step) (back to tree)

ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, phead ≠ rl2.last, pretRefs0(tid) ≠ null, rl2 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + qrl + rl, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottidRely(tid, (first ' + rl2.butlast).last, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from (first ' + rl2.butlast).last, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(rl1 + rl2 + qrl + rl), ¬ dups(rl1), ¬ dups(rl2 + qrl + rl), ¬ dups(rl1 + rl2), ¬ dups(qrl + rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, ¬ first ∈ rl, vs[(rl2 + qrl).last].next ≠ null → vs0[(rl2 + qrl).last].next = vs[(rl2 + qrl).last].next ∧ vs0[vs0[(rl2 + qrl).last].next].val = vs[vs0[(rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (first ' + rl2.butlast).last ≠ first → nextnottid(tid, (first ' + rl2.butlast).last, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → (first ' + rl2.butlast).last = first ∧ success, vs[(first ' + rl2.butlast).last].next ≠ null ∧ vs[vs[(first ' + rl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2.butlast).last].next].deqID.tid, vs[vs[(first ' + rl2.butlast).last].next].val), vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → (first ' + rl2.butlast).last = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl2 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl2 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2.butlast).last = first ∨ (first ' + rl2.butlast).last ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, rl2.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

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, vtail1, qrl0]

Additional information

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

Proof step 474 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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] ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 475 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, 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), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl2 + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0) ⊦

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] → [rl0, vtail1, rl3]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y

Proof step 476 from proof stable-D20 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = rl3 + vtail1 ', vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), 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), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail1 = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl0, vs0), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

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; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 477 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + vtail1 ') + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + rl2 + rl3).last ≠ vtail1, (first ' + rl2 + rl3).last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), nextnottidRely(tid, vhead, vs, (first ' + rl2 + rl3).last, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (first ' + rl2 + rl3).last ∈ ((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl3 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl3) + qrl0), ¬ dups((rl2 + rl3) + qrl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ (first ' + rl2 + rl3).last ∈ rl3, ¬ (first ' + rl2 + rl3).last ∈ rl2, ¬ (first ' + rl2 + rl3).last ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl3, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[(first ' + rl2 + rl3).last].next ≠ null ∧ vs0[vs0[(first ' + rl2 + rl3).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + rl2 + rl3).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + rl2 + rl3).last].next].deqID.tid, vs0[vs0[(first ' + rl2 + rl3).last].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 ∈ qrl0, (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, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first ', rl2 + rl3], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', rl2 + rl3

Proof step 478 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof step 479 from proof stable-D20 (previous step) (back to tree)

qrl + rl = (rl3 + vtail1 ') + qrl0, vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl3 ≠ [], (rl2 + rl3).last ≠ vtail1, (rl2 + rl3).last ≠ first, ps[first].next ≠ null, first ≠ vtail1, first ≠ lst, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), nextnottidRely(tid, vhead, vs, (rl2 + rl3).last, vs0), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0 from vtail, (rl2 + rl3).last ∈ ((rl1 + first ' + rl2) + rl3 + vtail1 ') + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl3 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + rl3) + qrl0), ¬ dups((rl2 + rl3) + qrl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ (rl2 + rl3).last ∈ rl3, ¬ (rl2 + rl3).last ∈ rl2, ¬ (rl2 + rl3).last ∈ rl1, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ rl3, ¬ vtail1 ∈ rl2, ¬ vtail1 ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[first].next ∈ rl1 ∨ vs[first].next ∈ rl2 ∨ vs[first].next ∈ qrl → vs[vs[first].next].val = vs0[vs[first].next].val ∧ ps[vs[first].next].val = ps0[vs[first].next].val ∧ (vs[vs[first].next].deqID ≠ None → vs0[vs[first].next].deqID = vs[vs[first].next].deqID) ∧ (ps[vs[first].next].deqID ≠ None → ps0[vs[first].next].deqID = ps[vs[first].next].deqID) ∧ (vs[vs[first].next].next ≠ null → vs0[vs[first].next].next = vs[vs[first].next].next) ∧ (ps[vs[first].next].next ≠ null → ps0[vs[first].next].next = ps[vs[first].next].next), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first ∧ success, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[(rl2 + rl3).last].next ≠ null ∧ vs0[vs0[(rl2 + rl3).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(rl2 + rl3).last].next].deqID.tid)) = Claimed(vs0[vs0[(rl2 + rl3).last].next].deqID.tid, vs0[vs0[(rl2 + rl3).last].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ps[first].next ∈ rl1 ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next), (success ⊃ vs[ps[first].next].deqID = Some(tid) ∧ rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ (ps[ps[first].next].deqID = None → vhead = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs) ;vs[ps[first].next].deqID ≠ None ∧ noid(tid, (rl1 + first ' + rl2) + qrl, first, vs) ∧ rvowns(pretRefs0(tid)) = Pending(tid) ), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl3], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl2, rl3

Proof step 480 from proof stable-D20 (previous step) (back to tree)

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

A spec-lemma

Proof Tree for stable-D20 (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