details

property	value
status	complete
benchmark	randomwalk.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n150.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	3.21995997429 seconds
cpu usage	3.232396638
max memory	3.3030144E7

stage attributes

key	value
output-size	44980
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l9 0: l0 -> l1 : N^0'=N^post0, walker^0'=walker^post0, i^0'=i^post0, seq^0'=seq^post0, choice^0'=choice^post0, z^0'=z^post0, pos^0'=pos^post0, (walker^0-walker^post0 == 0 /\ N^0-N^post0 == 0 /\ -z^post0+z^0 == 0 /\ -i^post0+i^0 == 0 /\ -pos^post0+pos^0 == 0 /\ choice^0-choice^post0 == 0 /\ -seq^post0+seq^0 == 0), cost: 1 1: l2 -> l3 : N^0'=N^post1, walker^0'=walker^post1, i^0'=i^post1, seq^0'=seq^post1, choice^0'=choice^post1, z^0'=z^post1, pos^0'=pos^post1, (seq^0-seq^post1 == 0 /\ choice^0-choice^post1 == 0 /\ -pos^post1+pos^0 == 0 /\ 1-choice^0 <= 0 /\ i^0-i^post1 == 0 /\ N^0-N^post1 == 0 /\ -z^post1+z^0 == 0 /\ -1-walker^0+walker^post1 == 0), cost: 1 2: l2 -> l3 : N^0'=N^post2, walker^0'=walker^post2, i^0'=i^post2, seq^0'=seq^post2, choice^0'=choice^post2, z^0'=z^post2, pos^0'=pos^post2, (-z^post2+z^0 == 0 /\ -pos^post2+pos^0 == 0 /\ N^0-N^post2 == 0 /\ seq^0-seq^post2 == 0 /\ 1-walker^0+walker^post2 == 0 /\ choice^0 <= 0 /\ -choice^post2+choice^0 == 0 /\ i^0-i^post2 == 0), cost: 1 12: l3 -> l8 : N^0'=N^post12, walker^0'=walker^post12, i^0'=i^post12, seq^0'=seq^post12, choice^0'=choice^post12, z^0'=z^post12, pos^0'=pos^post12, (N^0-N^post12 == 0 /\ walker^0-walker^post12 == 0 /\ -pos^post12+pos^0 == 0 /\ z^0-z^post12 == 0 /\ -i^post12+i^0 == 0 /\ -seq^post12+seq^0 == 0 /\ choice^0-choice^post12 == 0), cost: 1 3: l4 -> l3 : N^0'=N^post3, walker^0'=walker^post3, i^0'=i^post3, seq^0'=seq^post3, choice^0'=choice^post3, z^0'=z^post3, pos^0'=pos^post3, (0 == 0 /\ -2+N^post3 <= 0 /\ i^post3-seq^post3 == 0 /\ -choice^post3+choice^0 == 0 /\ -1+seq^post3 == 0 /\ pos^post3 == 0 /\ 2-N^post3 <= 0 /\ -1+walker^post3 == 0 /\ -z^post3 <= 0), cost: 1 4: l5 -> l2 : N^0'=N^post4, walker^0'=walker^post4, i^0'=i^post4, seq^0'=seq^post4, choice^0'=choice^post4, z^0'=z^post4, pos^0'=pos^post4, (0 == 0 /\ -1-seq^0+seq^post4 == 0 /\ -choice^post4+choice^0 == 0 /\ i^0 <= 0 /\ -pos^post4+pos^0 == 0 /\ i^post4-seq^post4 == 0 /\ -z^post4 <= 0 /\ walker^0-walker^post4 == 0 /\ N^0-N^post4 == 0), cost: 1 5: l5 -> l2 : N^0'=N^post5, walker^0'=walker^post5, i^0'=i^post5, seq^0'=seq^post5, choice^0'=choice^post5, z^0'=z^post5, pos^0'=pos^post5, (-pos^post5+pos^0 == 0 /\ -z^post5+z^0 == 0 /\ 1-i^0+i^post5 == 0 /\ 1-i^0 <= 0 /\ walker^0-walker^post5 == 0 /\ -seq^post5+seq^0 == 0 /\ choice^0 <= 0 /\ N^0-N^post5 == 0 /\ -choice^post5+choice^0 == 0), cost: 1 6: l6 -> l2 : N^0'=N^post6, walker^0'=walker^post6, i^0'=i^post6, seq^0'=seq^post6, choice^0'=choice^post6, z^0'=z^post6, pos^0'=pos^post6, (1+z^post6-z^0 == 0 /\ 1-z^0 <= 0 /\ pos^0-pos^post6 == 0 /\ -choice^post6+choice^0 == 0 /\ N^0-N^post6 == 0 /\ walker^0-walker^post6 == 0 /\ i^0-i^post6 == 0 /\ -seq^post6+seq^0 == 0), cost: 1 7: l6 -> l5 : N^0'=N^post7, walker^0'=walker^post7, i^0'=i^post7, seq^0'=seq^post7, choice^0'=choice^post7, z^0'=z^post7, pos^0'=pos^post7, (-seq^post7+seq^0 == 0 /\ N^0-N^post7 == 0 /\ -pos^post7+pos^0 == 0 /\ z^0-z^post7 == 0 /\ z^0 <= 0 /\ choice^0-choice^post7 == 0 /\ -i^post7+i^0 == 0 /\ walker^0-walker^post7 == 0), cost: 1 8: l7 -> l0 : N^0'=N^post8, walker^0'=walker^post8, i^0'=i^post8, seq^0'=seq^post8, choice^0'=choice^post8, z^0'=z^post8, pos^0'=pos^post8, (seq^0-seq^post8 == 0 /\ -pos^post8+pos^0 == 0 /\ walker^0 <= 0 /\ -i^post8+i^0 == 0 /\ choice^0-choice^post8 == 0 /\ walker^0-walker^post8 == 0 /\ N^0-N^post8 == 0 /\ z^0-z^post8 == 0), cost: 1 9: l7 -> l6 : N^0'=N^post9, walker^0'=walker^post9, i^0'=i^post9, seq^0'=seq^post9, choice^0'=choice^post9, z^0'=z^post9, pos^0'=pos^post9, (0 == 0 /\ walker^0-walker^post9 == 0 /\ N^0-N^post9 == 0 /\ -1+choice^post9 <= 0 /\ i^0-i^post9 == 0 /\ -choice^post9 <= 0 /\ 1-walker^0 <= 0 /\ -pos^post9+pos^0 == 0 /\ -z^post9+z^0 == 0 /\ seq^0-seq^post9 == 0), cost: 1 10: l8 -> l0 : N^0'=N^post10, walker^0'=walker^post10, i^0'=i^post10, seq^0'=seq^post10, choice^0'=choice^post10, z^0'=z^post10, pos^0'=pos^post10, (-pos^post10+pos^0 == 0 /\ i^0-i^post10 == 0 /\ -seq^post10+seq^0 == 0 /\ walker^0-walker^post10 == 0 /\ N^0-N^post10 == 0 /\ -z^post10+z^0 == 0 /\ 1+N^0-walker^0 <= 0 /\ -choice^post10+choice^0 == 0), cost: 1 11: l8 -> l7 : N^0'=N^post11, walker^0'=walker^post11, i^0'=i^post11, seq^0'=seq^post11, choice^0'=choice^post11, z^0'=z^post11, pos^0'=pos^post11, (-z^post11+z^0 == 0 /\ pos^0-pos^post11 == 0 /\ N^0-N^post11 == 0 /\ -choice^post11+choice^0 == 0 /\ -N^0+walker^0 <= 0 /\ -seq^post11+seq^0 == 0 /\ walker^0-walker^post11 == 0 /\ i^0-i^post11 == 0), cost: 1 13: l9 -> l4 : N^0'=N^post13, walker^0'=walker^post13, i^0'=i^post13, seq^0'=seq^post13, choice^0'=choice^post13, z^0'=z^post13, pos^0'=pos^post13, (seq^0-seq^post13 == 0 /\ -pos^post13+pos^0 == 0 /\ -i^post13+i^0 == 0 /\ walker^0-walker^post13 == 0 /\ -z^post13+z^0 == 0 /\ choice^0-choice^post13 == 0 /\ N^0-N^post13 == 0), cost: 1 Removed unreachable rules and leafs Start location: l9 1: l2 -> l3 : N^0'=N^post1, walker^0'=walker^post1, i^0'=i^post1, seq^0'=seq^post1, choice^0'=choice^post1, z^0'=z^post1, pos^0'=pos^post1, (seq^0-seq^post1 == 0 /\ choice^0-choice^post1 == 0 /\ -pos^post1+pos^0 == 0 /\ 1-choice^0 <= 0 /\ i^0-i^post1 == 0 /\ N^0-N^post1 == 0 /\ -z^post1+z^0 == 0 /\ -1-walker^0+walker^post1 == 0), cost: 1 2: l2 -> l3 : N^0'=N^post2, walker^0'=walker^post2, i^0'=i^post2, seq^0'=seq^post2, choice^0'=choice^post2, z^0'=z^post2, pos^0'=pos^post2, (-z^post2+z^0 == 0 /\ -pos^post2+pos^0 == 0 /\ N^0-N^post2 == 0 /\ seq^0-seq^post2 == 0 /\ 1-walker^0+walker^post2 == 0 /\ choice^0 <= 0 /\ -choice^post2+choice^0 == 0 /\ i^0-i^post2 == 0), cost: 1 12: l3 -> l8 : N^0'=N^post12, walker^0'=walker^post12, i^0'=i^post12, seq^0'=seq^post12, choice^0'=choice^post12, z^0'=z^post12, pos^0'=pos^post12, (N^0-N^post12 == 0 /\ walker^0-walker^post12 == 0 /\ -pos^post12+pos^0 == 0 /\ z^0-z^post12 == 0 /\ -i^post12+i^0 == 0 /\ -seq^post12+seq^0 == 0 /\ choice^0-choice^post12 == 0), cost: 1 3: l4 -> l3 : N^0'=N^post3, walker^0'=walker^post3, i^0'=i^post3, seq^0'=seq^post3, choice^0'=choice^post3, z^0'=z^post3, pos^0'=pos^post3, (0 == 0 /\ -2+N^post3 <= 0 /\ i^post3-seq^post3 == 0 /\ -choice^post3+choice^0 == 0 /\ -1+seq^post3 == 0 /\ pos^post3 == 0 /\ 2-N^post3 <= 0 /\ -1+walker^post3 == 0 /\ -z^post3 <= 0), cost: 1 4: l5 -> l2 : N^0'=N^post4, walker^0'=walker^post4, i^0'=i^post4, seq^0'=seq^post4, choice^0'=choice^post4, z^0'=z^post4, pos^0'=pos^post4, (0 == 0 /\ -1-seq^0+seq^post4 == 0 /\ -choice^post4+choice^0 == 0 /\ i^0 <= 0 /\ -pos^post4+pos^0 == 0 /\ i^post4-seq^post4 == 0 /\ -z^post4 <= 0 /\ walker^0-walker^post4 == 0 /\ N^0-N^post4 == 0), cost: 1 5: l5 -> l2 : N^0'=N^post5, walker^0'=walker^post5, i^0'=i^post5, seq^0'=seq^post5, choice^0'=choice^post5, z^0'=z^post5, pos^0'=pos^post5, (-pos^post5+pos^0 == 0 /\ -z^post5+z^0 == 0 /\ 1-i^0+i^post5 == 0 /\ 1-i^0 <= 0 /\ walker^0-walker^post5 == 0 /\ -seq^post5+seq^0 == 0 /\ choice^0 <= 0 /\ N^0-N^post5 == 0 /\ -choice^post5+choice^0 == 0), cost: 1 6: l6 -> l2 : N^0'=N^post6, walker^0'=walker^post6, i^0'=i^post6, seq^0'=seq^post6, choice^0'=choice^post6, z^0'=z^post6, pos^0'=pos^post6, (1+z^post6-z^0 == 0 /\ 1-z^0 <= 0 /\ pos^0-pos^post6 == 0 /\ -choice^post6+choice^0 == 0 /\ N^0-N^post6 == 0 /\ walker^0-walker^post6 == 0 /\ i^0-i^post6 == 0 /\ -seq^post6+seq^0 == 0), cost: 1 7: l6 -> l5 : N^0'=N^post7, walker^0'=walker^post7, i^0'=i^post7, seq^0'=seq^post7, choice^0'=choice^post7, z^0'=z^post7, pos^0'=pos^post7, (-seq^post7+seq^0 == 0 /\ N^0-N^post7 == 0 /\ -pos^post7+pos^0 == 0 /\ z^0-z^post7 == 0 /\ z^0 <= 0 /\ choice^0-choice^post7 == 0 /\ -i^post7+i^0 == 0 /\ walker^0-walker^post7 == 0), cost: 1 9: l7 -> l6 : N^0'=N^post9, walker^0'=walker^post9, i^0'=i^post9, seq^0'=seq^post9, choice^0'=choice^post9, z^0'=z^post9, pos^0'=pos^post9, (0 == 0 /\ walker^0-walker^post9 == 0 /\ N^0-N^post9 == 0 /\ -1+choice^post9 <= 0 /\ i^0-i^post9 == 0 /\ -choice^post9 <= 0 /\ 1-walker^0 <= 0 /\ -pos^post9+pos^0 == 0 /\ -z^post9+z^0 == 0 /\ seq^0-seq^post9 == 0), cost: 1 11: l8 -> l7 : N^0'=N^post11, walker^0'=walker^post11, i^0'=i^post11, seq^0'=seq^post11, choice^0'=choice^post11, z^0'=z^post11, pos^0'=pos^post11, (-z^post11+z^0 == 0 /\ pos^0-pos^post11 == 0 /\ N^0-N^post11 == 0 /\ -choice^post11+choice^0 == 0 /\ -N^0+walker^0 <= 0 /\ -seq^post11+seq^0 == 0 /\ walker^0-walker^post11 == 0 /\ i^0-i^post11 == 0), cost: 1 13: l9 -> l4 : N^0'=N^post13, walker^0'=walker^post13, i^0'=i^post13, seq^0'=seq^post13, choice^0'=choice^post13, z^0'=z^post13, pos^0'=pos^post13, (seq^0-seq^post13 == 0 /\ -pos^post13+pos^0 == 0 /\ -i^post13+i^0 == 0 /\ walker^0-walker^post13 == 0 /\ -z^post13+z^0 == 0 /\ choice^0-choice^post13 == 0 /\ N^0-N^post13 == 0), cost: 1 Applied preprocessing Original rule: l2 -> l3 : N^0'=N^post1, walker^0'=walker^post1, i^0'=i^post1, seq^0'=seq^post1, choice^0'=choice^post1, z^0'=z^post1, pos^0'=pos^post1, (seq^0-seq^post1 == 0 /\ choice^0-choice^post1 == 0 /\ -pos^post1+pos^0 == 0 /\ 1-choice^0 <= 0 /\ i^0-i^post1 == 0 /\ N^0-N^post1 == 0 /\ -z^post1+z^0 == 0 /\ -1-walker^0+walker^post1 == 0), cost: 1 New rule: l2 -> l3 : walker^0'=1+walker^0, -1+choice^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : N^0'=N^post2, walker^0'=walker^post2, i^0'=i^post2, seq^0'=seq^post2, choice^0'=choice^post2, z^0'=z^post2, pos^0'=pos^post2, (-z^post2+z^0 == 0 /\ -pos^post2+pos^0 == 0 /\ N^0-N^post2 == 0 /\ seq^0-seq^post2 == 0 /\ 1-walker^0+walker^post2 == 0 /\ choice^0 <= 0 /\ -choice^post2+choice^0 == 0 /\ i^0-i^post2 == 0), cost: 1 New rule: l2 -> l3 : walker^0'=-1+walker^0, choice^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : N^0'=N^post3, walker^0'=walker^post3, i^0'=i^post3, seq^0'=seq^post3, choice^0'=choice^post3, z^0'=z^post3, pos^0'=pos^post3, (0 == 0 /\ -2+N^post3 <= 0 /\ i^post3-seq^post3 == 0 /\ -choice^post3+choice^0 == 0 /\ -1+seq^post3 == 0 /\ pos^post3 == 0 /\ 2-N^post3 <= 0 /\ -1+walker^post3 == 0 /\ -z^post3 <= 0), cost: 1 New rule: l4 -> l3 : N^0'=2, walker^0'=1, i^0'=1, seq^0'=1, z^0'=z^post3, pos^0'=0, z^post3 >= 0, cost: 1 Applied preprocessing Original rule: l5 -> l2 : N^0'=N^post4, walker^0'=walker^post4, i^0'=i^post4, seq^0'=seq^post4, choice^0'=choice^post4, z^0'=z^post4, pos^0'=pos^post4, (0 == 0 /\ -1-seq^0+seq^post4 == 0 /\ -choice^post4+choice^0 == 0 /\ i^0 <= 0 /\ -pos^post4+pos^0 == 0 /\ i^post4-seq^post4 == 0 /\ -z^post4 <= 0 /\ walker^0-walker^post4 == 0 /\ N^0-N^post4 == 0), cost: 1 New rule: l5 -> l2 : i^0'=1+seq^0, seq^0'=1+seq^0, z^0'=z^post4, (i^0 <= 0 /\ z^post4 >= 0), cost: 1 Applied preprocessing Original rule: l5 -> l2 : N^0'=N^post5, walker^0'=walker^post5, i^0'=i^post5, seq^0'=seq^post5, choice^0'=choice^post5, z^0'=z^post5, pos^0'=pos^post5, (-pos^post5+pos^0 == 0 /\ -z^post5+z^0 == 0 /\ 1-i^0+i^post5 == 0 /\ 1-i^0 <= 0 /\ walker^0-walker^post5 == 0 /\ -seq^post5+seq^0 == 0 /\ choice^0 <= 0 /\ N^0-N^post5 == 0 /\ -choice^post5+choice^0 == 0), cost: 1 New rule: l5 -> l2 : i^0'=-1+i^0, (-1+i^0 >= 0 /\ choice^0 <= 0), cost: 1 Applied preprocessing Original rule: l6 -> l2 : N^0'=N^post6, walker^0'=walker^post6, i^0'=i^post6, seq^0'=seq^post6, choice^0'=choice^post6, z^0'=z^post6, pos^0'=pos^post6, (1+z^post6-z^0 == 0 /\ 1-z^0 <= 0 /\ pos^0-pos^post6 == 0 /\ -choice^post6+choice^0 == 0 /\ N^0-N^post6 == 0 /\ walker^0-walker^post6 == 0 /\ i^0-i^post6 == 0 /\ -seq^post6+seq^0 == 0), cost: 1 New rule: l6 -> l2 : z^0'=-1+z^0, -1+z^0 >= 0, cost: 1 Applied preprocessing Original rule: l6 -> l5 : N^0'=N^post7, walker^0'=walker^post7, i^0'=i^post7, seq^0'=seq^post7, choice^0'=choice^post7, z^0'=z^post7, pos^0'=pos^post7, (-seq^post7+seq^0 == 0 /\ N^0-N^post7 == 0 /\ -pos^post7+pos^0 == 0 /\ z^0-z^post7 == 0 /\ z^0 <= 0 /\ choice^0-choice^post7 == 0 /\ -i^post7+i^0 == 0 /\ walker^0-walker^post7 == 0), cost: 1 New rule: l6 -> l5 : z^0 <= 0, cost: 1 Applied preprocessing Original rule: l7 -> l6 : N^0'=N^post9, walker^0'=walker^post9, i^0'=i^post9, seq^0'=seq^post9, choice^0'=choice^post9, z^0'=z^post9, pos^0'=pos^post9, (0 == 0 /\ walker^0-walker^post9 == 0 /\ N^0-N^post9 == 0 /\ -1+choice^post9 <= 0 /\ i^0-i^post9 == 0 /\ -choice^post9 <= 0 /\ 1-walker^0 <= 0 /\ -pos^post9+pos^0 == 0 /\ -z^post9+z^0 == 0 /\ seq^0-seq^post9 == 0), cost: 1 New rule: l7 -> l6 : choice^0'=choice^post9, (-1+choice^post9 <= 0 /\ choice^post9 >= 0 /\ -1+walker^0 >= 0), cost: 1 Applied preprocessing Original rule: l8 -> l7 : N^0'=N^post11, walker^0'=walker^post11, i^0'=i^post11, seq^0'=seq^post11, choice^0'=choice^post11, z^0'=z^post11, pos^0'=pos^post11, (-z^post11+z^0 == 0 /\ pos^0-pos^post11 == 0 /\ N^0-N^post11 == 0 /\ -choice^post11+choice^0 == 0 /\ -N^0+walker^0 <= 0 /\ -seq^post11+seq^0 == 0 /\ walker^0-walker^post11 == 0 /\ i^0-i^post11 == 0), cost: 1 New rule: l8 -> l7 : -N^0+walker^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l8 : N^0'=N^post12, walker^0'=walker^post12, i^0'=i^post12, seq^0'=seq^post12, choice^0'=choice^post12, z^0'=z^post12, pos^0'=pos^post12, (N^0-N^post12 == 0 /\ walker^0-walker^post12 == 0 /\ -pos^post12+pos^0 == 0 /\ z^0-z^post12 == 0 /\ -i^post12+i^0 == 0 /\ -seq^post12+seq^0 == 0 /\ choice^0-choice^post12 == 0), cost: 1 New rule: l3 -> l8 : TRUE, cost: 1 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integer Transition Systems