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



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

Proof step 1 from proof step-E1-E2 (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)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → gstepf(gs, ls, E1, a).owns(lstepf(gs, ls, E1, a).node) = Some(lstepf(gs, ls, E1, a).tid) ∧ ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).ps ∧ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).vs ∧ lstepf(gs, ls, E1, a).node ≠ null ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).orl ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).qrl) ∧ ¬ lstepf(gs, ls, E1, a).success ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ oneowns(lstepf(gs, ls, E1, a).tid, lstepf(gs, ls, E1, a).node, gstepf(gs, ls, E1, a).owns, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-E1-E2 (previous step) (back to tree)

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

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 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 ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ((ls.node:= node0).nd:= nd0).success:= success0; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (ls.success:= success).success ↔ success; (s) ⊦ a ∈ st[a, d]; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ chooseE1(node, nd, success) = chooseE1(node0, nd0, success0) ↔ node = node0 ∧ nd = nd0 ∧ (success ↔ success0); (ws) ⊦ chooseE1(node, nd, success) ≠ τ; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ E1 ≠ E2; (s) ⊦ pcstepf(gs, ls, E1, a) = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1); (s)

Proof step 3 from proof step-E1-E2 (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], node ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ node ∈ gs.vs, ¬ node ∈ gs.ps, ¬ node ∈ gs.qrl, ¬ node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, 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) ⊦ oneowns(ls.tid, node, gs.owns(node; Some(ls.tid)), gs.vs[node, nd0], gs.ps[node, nd0]) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs[node, nd0]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs[node, nd0]) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[node, nd0][gs.qrl.last].deqID = None ∧ gs.vs[node, nd0][gs.qrl.last].next = null) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs[node, nd0])) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vs[node, nd0][gs.vhead].next ≠ null ∧ gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID.tid)) = Claimed(gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID.tid, gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].val)) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs[node, nd0], gs.vretRefs, gs.pretRefs) ∧ listp(gs.orl + gs.qrl, gs.vs[node, nd0], gs.ps[node, nd0], gs.owns(node; Some(ls.tid)))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 4 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(ls.tid, node, owns(node; Some(ls.tid)), vs[node, nd0], ps[node, nd0]) ∧ noid(ls.tid, orl + qrl, vhead, vs[node, nd0]) ∧ nextnottid(ls.tid, vhead, vs[node, nd0]) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][qrl.last].next = null) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, nd0])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vs[node, nd0][vhead].next ≠ null ∧ vs[node, nd0][vs[node, nd0][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid)) = Claimed(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid, vs[node, nd0][vs[node, nd0][vhead].next].val)) ∧ nonullRetRefs(orl + qrl, vs[node, nd0], vretRefs, pretRefs) ∧ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(ls.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-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ

Proof step 5 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(ls.tid, node, owns(node; Some(ls.tid)), vs[node, nd0], ps[node, nd0]) ∧ noid(ls.tid, orl + qrl, vhead, vs[node, nd0]) ∧ nextnottid(ls.tid, vhead, vs[node, nd0]) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][qrl.last].next = null) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, nd0])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vs[node, nd0][vhead].next ≠ null ∧ vs[node, nd0][vs[node, nd0][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid)) = Claimed(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid, vs[node, nd0][vs[node, nd0][vhead].next].val)) ∧ nonullRetRefs(orl + qrl, vs[node, nd0], vretRefs, pretRefs) ∧ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(ls.tid)))

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, node0, 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, node0, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval

Proof step 6 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node0, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(tid, node, owns(node; Some(tid)), vs[node, nd0], ps[node, nd0]) ∧ noid(tid, orl + qrl, vhead, vs[node, nd0]) ∧ nextnottid(tid, vhead, vs[node, nd0]) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][qrl.last].next = null) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, nd0])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vs[node, nd0][vhead].next ≠ null ∧ vs[node, nd0][vs[node, nd0][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid)) = Claimed(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid, vs[node, nd0][vs[node, nd0][vhead].next].val)) ∧ nonullRetRefs(orl + qrl, vs[node, nd0], vretRefs, pretRefs) ∧ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(tid)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, owns(node; Some(tid)), vs[node, nd0], ps[node, nd0]) ∧ noid(tid, orl + qrl, vhead, vs[node, nd0]) ∧ nextnottid(tid, vhead, vs[node, nd0]) ∧ ( vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][qrl.last].next = null) ∧ ( orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, nd0])) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ ( vs[node, nd0][vhead].next ≠ null ∧ vs[node, nd0][vs[node, nd0][vhead].next].deqID ≠ None → rvowns(vretRefs(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid)) = Claimed(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid, vs[node, nd0][vs[node, nd0][vhead].next].val)) ∧ nonullRetRefs(orl + qrl, vs[node, nd0], vretRefs, pretRefs) ∧ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 8 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ oneowns(tid, node, owns(node; Some(tid)), vs[node, nd0], ps[node, nd0]), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[node, nd0], tid, owns(node; Some(tid)), node, vs[node, nd0]], <all paths>

Additional information

Used terms: ps[node, nd0], tid, owns(node; Some(tid)), node, vs[node, nd0]

Proof step 9 from proof step-E1-E2 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 10 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ¬ node ∈ vs[node, nd0] ∨ ¬ node ∈ ps[node, nd0] ∨ owns(node; Some(tid))(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(node; Some(tid))(r0) ≠ None → owns(node; Some(tid))(r0).tid ≠ 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) ⊦ a ∈ st[a, d]; (s)

Proof step 11 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(owns(r0).tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noowns-def, seq: ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid), subst:[tid, owns] → [owns(r0).tid, owns], <all paths>

Additional information

Used terms: owns(r0).tid, owns

Proof step 12 from proof step-E1-E2 (previous step) (back to tree)

⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)

A spec-lemma

Proof step 13 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ 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), ∀ r. owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 28 terms: r0

Additional information

Used terms: r0

Proof step 14 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs[node, nd0]), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-reduce, seq:⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))), subst:[rl, tid, r, vs0, rl0, vs] → [orl + qrl, tid, vhead, vs[node, nd0], orl + qrl, vs], <all paths>

Additional information

Used terms: orl + qrl, tid, vhead, vs[node, nd0], orl + qrl, vs

Proof step 15 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 16 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ((r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[node, nd0][r0].deqID ≠ Some(tid)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 17 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][r0].deqID = Some(tid), dom vrvHp = dom prvHp, vs[r0].deqID ≠ Some(tid), node ≠ null, orl ≠ [], r0 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, r0], <all paths>

Additional information

Used terms: vs, node, nd0, r0

Proof step 18 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 19 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][r0].deqID = Some(tid), dom vrvHp = dom prvHp, r0 = node, vs[r0].deqID ≠ Some(tid), node ≠ null, orl ≠ [], r0 ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r0 ∈ orl + qrl from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 20 from proof step-E1-E2 (previous step) (back to tree)

nd0.deqID = Some(tid), dom vrvHp = dom prvHp, ∅[node].deqID ≠ Some(tid), node ≠ null, node ≠ vhead, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), node ∈ orl + qrl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail0, y

Proof step 21 from proof step-E1-E2 (previous step) (back to tree)

nd0.deqID = Some(tid), dom vrvHp = dom prvHp, qrl = vtail0 + qrl0, ∅[node].deqID ≠ Some(tid), node ≠ null, node ≠ vhead, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ orl + qrl from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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 = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ 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 22 from proof step-E1-E2 (previous step) (back to tree)

nd0.deqID = Some(tid), ps[vtail0].deqID = None, dom vrvHp = dom prvHp, ∅[node].deqID ≠ Some(tid), node ≠ null, node ≠ vhead, node ≠ vtail0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), node ∈ orl + vtail0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null ⊦

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] → [orl, vtail0 ' + qrl0, vhead], <all paths>

Additional information

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

Proof step 23 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 24 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, nd0.deqID = Some(tid), dom vrvHp = dom prvHp, ∅[node].deqID ≠ Some(tid), node ≠ null, node ≠ vhead, node ≠ vtail0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ orl + vtail0 ' + qrl0 from vhead, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead ∈ orl, ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, 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] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 25 from proof step-E1-E2 (previous step) (back to tree)

nd0.deqID = Some(tid), ps[vtail0].deqID = None, dom vrvHp = dom prvHp, ∅[node].deqID ≠ Some(tid), node ≠ null, node ≠ vhead, node ≠ vtail0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ vtail0 ' + qrl0 from vhead, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead ∈ orl, ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null ⊦

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] → [vtail0 ', qrl0, vhead], <all paths>

Additional information

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

Proof step 26 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 27 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottid(tid, vhead, vs[node, nd0]), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead, vs[node, nd0]], <all paths>

Additional information

Used terms: tid, vhead, vs[node, nd0]

Proof step 28 from proof step-E1-E2 (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 29 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[node, nd0][vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, vs[node, nd0][vhead].next ≠ null, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [orl, vtail0, qrl0]

Additional information

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

Proof step 30 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[node, nd0][vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', vs[node, nd0][vhead].next ≠ null, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (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 ' + 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 31 from proof step-E1-E2 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: vs, node, nd0, vhead

Proof step 32 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 33 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 34 from proof step-E1-E2 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 33

Additional information

Proof step 35 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 36 from proof step-E1-E2 (previous step) (back to tree)

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

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] → [ps, qrl0, owns, vhead ' + qrl, vs]

Additional information

Used terms: ps, qrl0, owns, vhead ' + qrl, vs

Proof step 37 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 38 from proof step-E1-E2 (previous step) (back to tree)

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

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)

Proof step 39 from proof step-E1-E2 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

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) ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s)

Proof step 40 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[vhead].next].deqID = Some(tid), dom vrvHp = dom prvHp, qrl = node0 + qrl1, vs[vhead].next ≠ null, node ≠ null, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vhead ' + qrl, vs, ps, owns), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vs[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 ≠ [] → unmarkedp(qrl.tail, vs), vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vhead ⊦

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 ≠ b → st[b, d][a] = st[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (a ' + x).tail = x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (b ' + a ' + x).last = (a ' + x).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) ⊦ 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 41 from proof step-E1-E2 (previous step) (back to tree)

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

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, qrl0 + vhead ' + vs[vhead].next ' + qrl1, vhead, vs], <all paths>

Additional information

Used terms: tid, qrl0 + vhead ' + vs[vhead].next ' + qrl1, vhead, vs

Proof step 42 from proof step-E1-E2 (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 43 from proof step-E1-E2 (previous step) (back to tree)

ps[vs[vhead].next].deqID = None, ps[vhead].deqID = vs[vhead].deqID, vs[vs[vhead].next].deqID = Some(tid), ps[vhead].next = vs[vhead].next, ps[vhead].val = vs[vhead].val, dom vrvHp = dom prvHp, owns(vhead) = None, rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null, node ≠ vs[vhead].next, node ≠ null, vhead ≠ vs[vhead].next, vhead ≠ null, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vhead ' + vs[vhead].next ' + qrl1, vs, ps, owns), listp(vs[vhead].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs(qrl0 + vhead ' + vs[vhead].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), phead ∈ vs, phead ∈ ps, vhead ∈ vs, vhead ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ weak?(vs[vhead].deqID), ¬ node ∈ qrl1, ¬ node ∈ ps, ¬ node ∈ vs, ¬ vhead ∈ qrl1, ¬ vhead ∈ qrl0, ¬ vs[vhead].next ∈ qrl1, ¬ vs[vhead].next ∈ qrl0, ¬ node ∈ qrl0, ∀ r0. r0 ≠ vhead ∧ r0 ∈ qrl0 + vhead ' + vs[vhead].next ' + qrl1 from vhead → vs[r0].deqID ≠ Some(tid), vtail = (vs[vhead].next ' + qrl1).last ∨ vtail = (vhead ' + (vs[vhead].next ' + qrl1).butlast).last ∧ vs[(vs[vhead].next ' + qrl1).last].deqID = None ∧ vs[(vs[vhead].next ' + qrl1).last].next = null, phead ∈ qrl0 ∨ phead = vhead ⊦

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

Proof step 44 from proof step-E1-E2 (previous step) (back to tree)

vs[vs[vhead].next].deqID = Some(tid), ps[vhead].deqID = vs[vhead].deqID, ps[vs[vhead].next].deqID = None, ps[vhead].next = vs[vhead].next, ps[vhead].val = vs[vhead].val, dom vrvHp = dom prvHp, owns(vhead) = None, rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null, node ≠ vs[vhead].next, node ≠ null, vhead ≠ vs[vhead].next, vhead ≠ null, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vhead].next ' + qrl1, vs, ps, owns), listp(qrl0 + vhead ' + vs[vhead].next ' + qrl1, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs(qrl0 + vhead ' + vs[vhead].next ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[vhead].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), vhead ∈ ps, vhead ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ weak?(vs[vhead].deqID), ¬ node ∈ qrl1, ¬ node ∈ ps, ¬ node ∈ vs, ¬ vhead ∈ qrl1, ¬ vhead ∈ qrl0, ¬ vs[vhead].next ∈ qrl1, ¬ vs[vhead].next ∈ qrl0, ¬ node ∈ qrl0, ∀ r0. r0 ≠ vhead ∧ (r0 = vs[vhead].next ∨ r0 ∈ qrl1) → vs[r0].deqID ≠ Some(tid), phead ∈ qrl0 ∨ phead = vhead, vtail = (vs[vhead].next ' + qrl1).last ∨ vtail = (vhead ' + (vs[vhead].next ' + qrl1).butlast).last ∧ vs[(vs[vhead].next ' + qrl1).last].deqID = None ∧ vs[(vs[vhead].next ' + qrl1).last].next = null ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 45 terms: vs[vhead].next abort: F discard: F computed: T

Additional information

Used terms: vs[vhead].next

Proof step 45 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 46 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[qrl0.last].next].deqID = Some(tid), dom vrvHp = dom prvHp, qrl0.last ≠ node, vs[qrl0.last].next ≠ null, node ≠ null, node ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, qrl0.last, vs), noid(tid, (qrl0 + vtail0 ') + qrl, qrl0.last, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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

Additional information

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

Proof step 47 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[phead0].next].deqID = Some(tid), dom vrvHp = dom prvHp, qrl0 = qrl1 + phead0 ', vs[phead0].next ≠ null, node ≠ null, node ≠ vtail0, phead ≠ vtail0, phead0 ≠ node, qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, phead0, vs), noid(tid, (qrl0 + vtail0 ') + qrl, phead0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ qrl0, phead ∈ ps, phead ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + 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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 48 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[phead0].next].deqID = Some(tid), dom vrvHp = dom prvHp, ps[phead0].next ≠ phead0, vs[phead0].next ≠ null, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, phead0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[ps[phead0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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] → [ps, qrl1, owns, phead0 ' + ps[phead0].next ' + qrl, vs]

Additional information

Used terms: ps, qrl1, owns, phead0 ' + ps[phead0].next ' + qrl, vs

Proof step 49 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 50 from proof step-E1-E2 (previous step) (back to tree)

vs[node, nd0][vs[phead0].next].deqID = Some(tid), dom vrvHp = dom prvHp, ps[phead0].next ≠ phead0, vs[phead0].next ≠ null, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, phead0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[phead0].next].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), listp(qrl1 + phead0 ' + ps[phead0].next ' + qrl, vs, ps, owns) → (listp(phead0 ' + ps[phead0].next ' + qrl, vs, ps, owns) ↔ phead0 ' + ps[phead0].next ' + qrl ≠ []), vtail = (ps[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl1 ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ Some(tid).tid = tid; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a ' + x ≠ []; (s)

Proof step 51 from proof step-E1-E2 (previous step) (back to tree)

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

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, ((qrl1 + phead0 ') + vs[phead0].next ') + qrl, phead0, vs], <all paths>

Additional information

Used terms: tid, ((qrl1 + phead0 ') + vs[phead0].next ') + qrl, phead0, vs

Proof step 52 from proof step-E1-E2 (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 53 from proof step-E1-E2 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid), ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, owns(phead0) = None, rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[phead0].next].val), vs[phead0].next ≠ phead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, phead ≠ vs[phead0].next, phead0 ≠ node, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + qrl, vs, ps, owns), listp(((qrl1 + phead0 ') + vs[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + vs[phead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[phead0].next].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, ¬ vs[phead0].next ∈ qrl, ¬ vs[phead0].next ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, ∀ r0. r0 ≠ phead0 ∧ r0 ∈ ((qrl1 + phead0 ') + vs[phead0].next ') + qrl from phead0 → vs[r0].deqID ≠ Some(tid), vtail = (vs[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl1 ∨ phead = phead0 ⊦

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

Proof step 54 from proof step-E1-E2 (previous step) (back to tree)

vs[vs[phead0].next].deqID = Some(tid), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, owns(phead0) = None, rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[phead0].next].val), vs[phead0].next ≠ phead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, phead ≠ vs[phead0].next, phead0 ≠ node, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + phead0 ') + vs[phead0].next ') + qrl, vs, ps, owns), listp(vs[phead0].next ' + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + vs[phead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), some?(ps[vs[phead0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, ¬ vs[phead0].next ∈ qrl, ¬ vs[phead0].next ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, ∀ r0. r0 ≠ phead0 ∧ (r0 = vs[phead0].next ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), phead ∈ qrl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 46 terms: vs[phead0].next abort: F discard: F computed: T

Additional information

Used terms: vs[phead0].next

Proof step 55 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], vtail ≠ (orl + qrl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][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] ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 56 from proof step-E1-E2 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][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-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, phead0, orl0]

Additional information

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

Proof step 57 from proof step-E1-E2 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vs[node, nd0][qrl.last].deqID = None ∧ vs[node, nd0][qrl.last].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 58 from proof step-E1-E2 (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ ps, ¬ node ∈ vs, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vs[node, nd0][(phead0 ' + orl0).last].deqID = None ∧ vs[node, nd0][(phead0 ' + orl0).last].next = null

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] → [phead0 ', orl0], <all paths>

Additional information

Used simplifier rules: ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) Used terms: phead0 ', orl0

Proof step 59 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 60 from proof step-E1-E2 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ ps, ¬ node ∈ vs, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vs[node, nd0][(phead0 ' + orl0).last].deqID = None ∧ vs[node, nd0][(phead0 ' + orl0).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 ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 61 from proof step-E1-E2 (previous step) (back to tree)

ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (phead0 ' + orl0.butlast).last ≠ orl0.last, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ ps, ¬ node ∈ vs, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vs[node, nd0][orl0.last].deqID = None ∧ vs[node, nd0][orl0.last].next = null

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] → [orl0, vhead0, orl1]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y

Proof step 62 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs[node, nd0])), orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.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] ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 63 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.last, vs), noid(tid, orl + qrl, orl.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ unmarkedp(qrl.tail, vs[node, nd0]), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = orl.last ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)

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

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 = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 64 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, vs[node, nd0][vs[node, nd0][vhead].next].deqID ≠ None, vs[node, nd0][vhead].next ≠ null, node ≠ null, orl ≠ [], rvowns(vretRefs(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid)) ≠ Claimed(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid, vs[node, nd0][vs[node, nd0][vhead].next].val), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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] → [orl, vtail0, qrl0]

Additional information

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

Proof step 65 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', vs[node, nd0][vs[node, nd0][vhead].next].deqID ≠ None, vs[node, nd0][vhead].next ≠ null, node ≠ null, orl ≠ [], rvowns(vretRefs(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid)) ≠ Claimed(vs[node, nd0][vs[node, nd0][vhead].next].deqID.tid, vs[node, nd0][vs[node, nd0][vhead].next].val), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ 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] ⊦ (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 ' + 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 66 from proof step-E1-E2 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: vs, node, nd0, vhead

Proof step 67 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 68 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 69 from proof step-E1-E2 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, vs[vhead].next], <all paths>

Additional information

Used terms: vs, node, nd0, vs[vhead].next

Proof step 70 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 71 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 72 from proof step-E1-E2 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 33

Additional information

Proof step 73 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 74 from proof step-E1-E2 (previous step) (back to tree)

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

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] → [ps, qrl0, owns, vhead ' + qrl, vs]

Additional information

Used terms: ps, qrl0, owns, vhead ' + qrl, vs

Proof step 75 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 76 from proof step-E1-E2 (previous step) (back to tree)

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

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

Proof step 77 from proof step-E1-E2 (previous step) (back to tree)

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

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

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) ⊦ 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 ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 78 from proof step-E1-E2 (previous step) (back to tree)

qrl0.last = vhead, dom vrvHp = dom prvHp, nd0.deqID ≠ None, vs[vhead].next ≠ null, vs[vhead].next ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], rvowns(vretRefs(nd0.deqID.tid)) ≠ Claimed(nd0.deqID.tid, nd0.val), vhead ≠ vs[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vs[vhead].next ∈ vs, ¬ vs[vhead].next ∈ ps, ¬ vs[vhead].next ∈ qrl, ¬ vs[vhead].next ∈ qrl0, ∅[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(∅[vs[vhead].next].deqID.tid)) = Claimed(∅[vs[vhead].next].deqID.tid, ∅[vs[vhead].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 79 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, nd0.deqID ≠ None, qrl0.last ≠ vs[qrl0.last].next, vs[qrl0.last].next ≠ null, vs[qrl0.last].next ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], rvowns(vretRefs(nd0.deqID.tid)) ≠ Claimed(nd0.deqID.tid, nd0.val), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.last, vs), noid(tid, (qrl0 + vtail0 ') + qrl, qrl0.last, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vs[qrl0.last].next ∈ vs, ¬ vs[qrl0.last].next ∈ ps, ¬ vs[qrl0.last].next ∈ qrl, ¬ vs[qrl0.last].next ∈ qrl0, ∅[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(∅[vs[qrl0.last].next].deqID.tid)) = Claimed(∅[vs[qrl0.last].next].deqID.tid, ∅[vs[qrl0.last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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

Additional information

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

Proof step 80 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, qrl0 = qrl1 + phead0 ', nd0.deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vtail0, phead ≠ vtail0, phead0 ≠ vs[phead0].next, qrl0 ≠ [], rvowns(vretRefs(nd0.deqID.tid)) ≠ Claimed(nd0.deqID.tid, nd0.val), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (qrl0 + vtail0 ') + qrl, phead0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ qrl0, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vs[phead0].next ∈ vs, ¬ vs[phead0].next ∈ ps, ¬ vs[phead0].next ∈ qrl, ¬ vs[phead0].next ∈ qrl0, ∅[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(∅[vs[phead0].next].deqID.tid)) = Claimed(∅[vs[phead0].next].deqID.tid, ∅[vs[phead0].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + 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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 81 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, nd0.deqID ≠ None, ps[phead0].next ≠ phead0, vs[phead0].next ≠ ps[phead0].next, vs[phead0].next ≠ null, phead ≠ ps[phead0].next, phead0 ≠ vs[phead0].next, rvowns(vretRefs(nd0.deqID.tid)) ≠ Claimed(nd0.deqID.tid, nd0.val), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[ps[phead0].next].deqID), some?(ps[ps[phead0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ vs[phead0].next ∈ qrl1, ¬ vs[phead0].next ∈ qrl, ¬ vs[phead0].next ∈ ps, ¬ vs[phead0].next ∈ vs, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, ∅[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(∅[vs[phead0].next].deqID.tid)) = Claimed(∅[vs[phead0].next].deqID.tid, ∅[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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] → [ps, qrl1, owns, phead0 ' + ps[phead0].next ' + qrl, vs]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, qrl1, owns, phead0 ' + ps[phead0].next ' + qrl, vs

Proof step 82 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 83 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nonullRetRefs(orl + qrl, vs[node, nd0], vretRefs, pretRefs), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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 + y).head = x.head; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)

Proof step 84 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, vs[node, nd0][r].deqID ≠ None, node ≠ null, orl ≠ [], r ≠ orl.head, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ vretRefs(vs[node, nd0][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, nd0][r].deqID.tid) ≠ null

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] → [orl, vtail0, qrl0]

Additional information

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

Proof step 85 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl = vtail0 + qrl0, vs[node, nd0][r].deqID ≠ None, node ≠ null, orl ≠ [], r ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vretRefs(vs[node, nd0][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, nd0][r].deqID.tid) ≠ null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 86 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, vs[node, nd0][r].deqID ≠ None, node ≠ null, node ≠ vtail0, r ≠ vtail0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (vtail0 ' + qrl0) + qrl, vhead, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, phead = vtail0 ∨ phead ∈ qrl0, vtail = ((vtail0 ' + qrl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail0 ' + qrl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vtail0 ' + qrl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ (vtail0 ' + qrl0.butlast).last = vhead ∧ phead ≠ qrl0.last ∧ unmarkedp(qrl, vs), r ∈ qrl0 ∨ r ∈ qrl ⊦ vretRefs(vs[node, nd0][r].deqID.tid) ≠ null ∧ pretRefs(vs[node, nd0][r].deqID.tid) ≠ null

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, r], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) Used terms: vs, node, nd0, r

Proof step 87 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 88 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-modps, seq:⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps[node, nd], owns) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, node, nd, owns, vs] → [ps, orl + qrl, node, nd0, owns(node; Some(tid)), vs[node, nd0]], <all paths>

Additional information

Used terms: ps, orl + qrl, node, nd0, owns(node; Some(tid)), vs[node, nd0]

Proof step 89 from proof step-E1-E2 (previous step) (back to tree)

⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps[node, nd], owns) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 90 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ¬ node ∈ orl + qrl ∧ orl + qrl ≠ [] ∧ node ≠ vs[node, nd0][(orl + qrl).last].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 + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 91 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node = vs[node, nd0][(orl + qrl).last].next, orl + qrl ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(tid))), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, (orl + qrl).last], <all paths>

Additional information

Used simplifier rules: listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ Used terms: vs, node, nd0, (orl + qrl).last

Proof step 92 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 93 from proof step-E1-E2 (previous step) (back to tree)

(orl + qrl).last = node, dom vrvHp = dom prvHp, node = vs[node, nd0][(orl + qrl).last].next, orl + qrl ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ listp(orl + qrl, vs[node, nd0], ps[node, nd0], owns(node; Some(tid))), ¬ node ∈ orl, ¬ node ∈ qrl, ¬ node ∈ ps, ¬ node ∈ vs, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s)

Proof step 94 from proof step-E1-E2 (previous step) (back to tree)

(orl + qrl).last = nd0.next, dom vrvHp = dom prvHp, orl + qrl ≠ [], nd0.next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ listp(orl + qrl, vs[nd0.next, nd0], ps[nd0.next, nd0], owns(nd0.next; Some(tid))), ¬ nd0.next ∈ orl, ¬ nd0.next ∈ qrl, ¬ nd0.next ∈ ps, ¬ nd0.next ∈ vs, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = nd0.next ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [orl, qrl], <all paths>

Additional information

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

Proof step 95 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 96 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl + qrl ≠ [], node ≠ vs[node, nd0][(orl + qrl).last].next, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl + qrl, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 97 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl + qrl ≠ [], node ≠ vs[node, nd0][(orl + qrl).last].next, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, node, nd0, (orl + qrl).last], <all paths>

Additional information

Used terms: vs, node, nd0, (orl + qrl).last

Proof step 98 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 99 from proof step-E1-E2 (previous step) (back to tree)

(orl + qrl).last = node, dom vrvHp = dom prvHp, orl + qrl ≠ [], node ≠ vs[node, nd0][(orl + qrl).last].next, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s)

Proof step 100 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl + qrl ≠ [], (orl + qrl).last ≠ null, (orl + qrl).last ≠ nd0.next, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[(orl + qrl).last, nd0], ps, owns((orl + qrl).last; Some(tid))), ¬ (orl + qrl).last ∈ vs, ¬ (orl + qrl).last ∈ ps, ¬ (orl + qrl).last ∈ qrl, ¬ (orl + qrl).last ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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] → [orl, qrl], <all paths>

Additional information

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

Proof step 101 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 102 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl + qrl ≠ [], (orl + qrl).last ≠ node, node ≠ vs[(orl + qrl).last].next, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [orl, qrl], <all paths>

Additional information

Used terms: orl, qrl

Proof step 103 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 104 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, qrl = [], orl + qrl ≠ [], (orl + qrl).last ≠ node, node ≠ vs[(orl + qrl).last].next, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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 + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs[node, nd], ps, owns) ↔ listp(rl, vs, ps, owns)); (s) ⊦ ¬ dups([]); (s)

Proof step 105 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl.last ≠ node, node ≠ vs[orl.last].next, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ listp(orl, vs, ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ node ∈ ps, ¬ node ∈ vs, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.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] → [orl, phead0, orl0]

Additional information

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

Proof step 106 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl = orl0 + phead0 ', node ≠ vs[phead0].next, node ≠ null, orl ≠ [], phead0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ listp(orl, vs, ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ node ∈ ps, ¬ node ∈ 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), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦

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) ⊦ 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 107 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ vs[phead0].next, node ≠ null, phead0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ listp(orl0 + phead0 ', vs, ps, owns(node; Some(tid))), ¬ node ∈ ps, ¬ node ∈ vs, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-nextoflast, seq:⊦ 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)), subst:[rl, vs, ps, owns] → [orl0 + phead0 ', vs, ps, owns]

Additional information

Used terms: orl0 + phead0 ', vs, ps, owns

Proof step 108 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 109 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ vs[phead0].next, node ≠ null, phead0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ listp(orl0 + phead0 ', vs, ps, owns(node; Some(tid))), ¬ node ∈ ps, ¬ node ∈ vs, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl0 + phead0 ', vs, ps, owns) ∧ vs[(orl0 + phead0 ').last].next ≠ null → vs[(orl0 + phead0 ').last].next ∈ vs ∧ vs[(orl0 + phead0 ').last].next ∈ ps ∧ ps[vs[(orl0 + phead0 ').last].next] = vs[vs[(orl0 + phead0 ').last].next] ∧ ps[vs[(orl0 + phead0 ').last].next].deqID = None ∧ ps[vs[(orl0 + phead0 ').last].next].next = null ∧ weak?(owns(vs[(orl0 + phead0 ').last].next)), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦

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

Proof step 110 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, node ≠ vs[phead0].next, node ≠ null, phead0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ listp(orl0 + phead0 ', vs, ps, owns(node; Some(tid))), ¬ node ∈ ps, ¬ node ∈ vs, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[phead0].next ≠ null → vs[phead0].next ∈ vs ∧ vs[phead0].next ∈ ps ∧ ps[vs[phead0].next] = vs[vs[phead0].next] ∧ ps[vs[phead0].next].deqID = None ∧ ps[vs[phead0].next].next = null ∧ weak?(owns(vs[phead0].next)), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-modowns, seq:⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps, owns(node; Some(tid))) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, node, tid, owns, vs] → [ps, orl0 + phead0 ', node, tid, owns, vs], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0 + phead0 ', node, tid, owns, vs

Proof step 111 from proof step-E1-E2 (previous step) (back to tree)

⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps, owns(node; Some(tid))) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 112 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl + qrl ≠ [], qrl.last ≠ node, node ≠ vs[qrl.last].next, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + 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

Proof step 113 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl + qrl ≠ [], qrl.last ≠ node, node ≠ vs[qrl.last].next, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.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-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, vtail0, qrl0]

Additional information

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

Proof step 114 from proof step-E1-E2 (previous step) (back to tree)

dom vrvHp = dom prvHp, qrl = vtail0 + qrl0, orl + qrl ≠ [], qrl.last ≠ node, node ≠ vs[qrl.last].next, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 115 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, (vtail0 ' + qrl0).last ≠ node, node ≠ null, node ≠ vs[(vtail0 ' + qrl0).last].next, node ≠ vtail0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ listp(orl + vtail0 ' + qrl0, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

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 ', qrl0], <all paths>

Additional information

Used terms: vtail0 ', qrl0

Proof step 116 from proof step-E1-E2 (previous step) (back to tree)

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

A spec-lemma

Proof step 117 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, qrl0 = [], (vtail0 ' + qrl0).last ≠ node, node ≠ null, node ≠ vs[(vtail0 ' + qrl0).last].next, node ≠ vtail0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ listp(orl + vtail0 ' + qrl0, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 118 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, node ≠ null, node ≠ vs[vtail0].next, orl ≠ [], vtail0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ listp(orl + vtail0 ', vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ node ∈ vs, ¬ node ∈ ps, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-modowns, seq:⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps, owns(node; Some(tid))) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, node, tid, owns, vs] → [ps, orl + vtail0 ', node, tid, owns, vs[node, nd0]], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) Used terms: ps, orl + vtail0 ', node, tid, owns, vs[node, nd0]

Proof step 119 from proof step-E1-E2 (previous step) (back to tree)

⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps, owns(node; Some(tid))) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 120 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl + vtail0 ' ≠ [], node ≠ vs[node, nd0][(orl + vtail0 ').last].next, node ≠ null, node ≠ vs[vtail0].next, orl ≠ [], vtail0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ listp(orl + vtail0 ', vs[node, nd0], ps, owns), ¬ node ∈ orl + vtail0 ', ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ node ∈ vs, ¬ node ∈ ps, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 121 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, node ≠ null, node ≠ vs[vtail0].next, orl ≠ [], vtail0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ listp(orl + vtail0 ', vs[node, nd0], ps, owns), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ node ∈ vs, ¬ node ∈ ps, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-modvs, seq:⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs[node, nd], ps, owns) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, node, nd, owns, vs] → [ps, orl + vtail0 ', node, nd0, owns, vs], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + vtail0 ', node, nd0, owns, vs

Proof step 122 from proof step-E1-E2 (previous step) (back to tree)

⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs[node, nd], ps, owns) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 123 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, qrl0.last ≠ node, node ≠ null, node ≠ vs[qrl0.last].next, node ≠ vtail0, orl ≠ [], qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ listp(orl + vtail0 ' + qrl0, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 124 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, qrl0.last ≠ node, node ≠ null, node ≠ vs[qrl0.last].next, node ≠ vtail0, orl ≠ [], qrl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ listp(orl + vtail0 ' + qrl0, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = qrl0.last ∨ vtail = (vtail0 ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

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, phead0, orl0]

Additional information

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

Proof step 125 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, dom vrvHp = dom prvHp, qrl0 = orl0 + phead0 ', node ≠ null, node ≠ vs[phead0].next, node ≠ vtail0, orl ≠ [], phead0 ≠ node, qrl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ listp(orl + vtail0 ' + qrl0, vs[node, nd0], ps, owns(node; Some(tid))), ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, 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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 126 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, node ≠ null, node ≠ vs[phead0].next, node ≠ vtail0, orl ≠ [], phead0 ≠ node, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ listp(orl + vtail0 ' + orl0 + phead0 ', vs[node, nd0], ps, owns(node; Some(tid))), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-modowns, seq:⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps, owns(node; Some(tid))) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, node, tid, owns, vs] → [ps, orl + vtail0 ' + orl0 + phead0 ', node, tid, owns, vs[node, nd0]], <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 ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) Used terms: ps, orl + vtail0 ' + orl0 + phead0 ', node, tid, owns, vs[node, nd0]

Proof step 127 from proof step-E1-E2 (previous step) (back to tree)

⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs, ps, owns(node; Some(tid))) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof step 128 from proof step-E1-E2 (previous step) (back to tree)

ps[phead0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl + vtail0 ' + orl0 + phead0 ' ≠ [], node ≠ vs[node, nd0][(orl + vtail0 ' + orl0 + phead0 ').last].next, node ≠ null, node ≠ vs[phead0].next, node ≠ vtail0, orl ≠ [], phead0 ≠ node, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ listp(orl + vtail0 ' + orl0 + phead0 ', vs[node, nd0], ps, owns), ¬ node ∈ orl + vtail0 ' + orl0 + phead0 ', ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (vtail0 ' + orl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 129 from proof step-E1-E2 (previous step) (back to tree)

ps[vtail0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, node ≠ null, node ≠ vtail0, node ≠ vs[phead0].next, orl ≠ [], phead0 ≠ node, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ listp(orl + vtail0 ' + orl0 + phead0 ', vs[node, nd0], ps, owns), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ node ∈ orl, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ vs, ¬ node ∈ ps, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-modvs, seq:⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs[node, nd], ps, owns) ↔ listp(rl, vs, ps, owns)), subst:[ps, rl, node, nd, owns, vs] → [ps, orl + vtail0 ' + orl0 + phead0 ', node, nd0, owns, vs], <all paths>

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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) Used terms: ps, orl + vtail0 ' + orl0 + phead0 ', node, nd0, owns, vs

Proof step 130 from proof step-E1-E2 (previous step) (back to tree)

⊦ ¬ node ∈ rl ∧ rl ≠ [] ∧ node ≠ vs[rl.last].next → (listp(rl, vs[node, nd], ps, owns) ↔ listp(rl, vs, ps, owns))

A spec-lemma

Proof Tree for step-E1-E2 (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