Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097355
details
property
value
status
complete
benchmark
simpleWhile.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.129089 seconds
cpu usage
0.131807
user time
0.112428
system time
0.019379
max virtual memory
113188.0
max residence set size
19132.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l10 0: l0 -> l1 : N^0'=N^post0, tmp^0'=tmp^post0, i^0'=i^post0, x^0'=x^post0, (i^0-i^post0 == 0 /\ -2+x^post0-x^0 == 0 /\ N^0-N^post0 == 0 /\ tmp^0-tmp^post0 == 0), cost: 1 1: l0 -> l1 : N^0'=N^post1, tmp^0'=tmp^post1, i^0'=i^post1, x^0'=x^post1, (-i^post1+i^0 == 0 /\ N^0-N^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ -x^post1+x^0 == 0), cost: 1 13: l1 -> l4 : N^0'=N^post13, tmp^0'=tmp^post13, i^0'=i^post13, x^0'=x^post13, (-1+i^post13-i^0 == 0 /\ -x^post13+x^0 == 0 /\ N^0-N^post13 == 0 /\ tmp^0-tmp^post13 == 0), cost: 1 2: l2 -> l3 : N^0'=N^post2, tmp^0'=tmp^post2, i^0'=i^post2, x^0'=x^post2, (-i^post2+i^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ N^0-i^0 <= 0 /\ -x^post2+x^0 == 0 /\ N^0-N^post2 == 0), cost: 1 3: l2 -> l0 : N^0'=N^post3, tmp^0'=tmp^post3, i^0'=i^post3, x^0'=x^post3, (N^0-N^post3 == 0 /\ 1-N^0+i^0 <= 0 /\ tmp^0-tmp^post3 == 0 /\ i^0-i^post3 == 0 /\ -x^post3+x^0 == 0), cost: 1 10: l3 -> l7 : N^0'=N^post10, tmp^0'=tmp^post10, i^0'=i^post10, x^0'=x^post10, (-x^post10+x^0 == 0 /\ 1+N^0-x^0 <= 0 /\ N^0-N^post10 == 0 /\ -i^post10+i^0 == 0 /\ tmp^0-tmp^post10 == 0), cost: 1 11: l3 -> l7 : N^0'=N^post11, tmp^0'=tmp^post11, i^0'=i^post11, x^0'=x^post11, (1-N^0+x^0 <= 0 /\ i^0-i^post11 == 0 /\ -x^post11+x^0 == 0 /\ N^0-N^post11 == 0 /\ tmp^0-tmp^post11 == 0), cost: 1 12: l3 -> l6 : N^0'=N^post12, tmp^0'=tmp^post12, i^0'=i^post12, x^0'=x^post12, (-N^0+x^0 <= 0 /\ i^0-i^post12 == 0 /\ -1+tmp^post12 == 0 /\ N^0-N^post12 == 0 /\ -x^post12+x^0 == 0 /\ N^0-x^0 <= 0), cost: 1 4: l4 -> l2 : N^0'=N^post4, tmp^0'=tmp^post4, i^0'=i^post4, x^0'=x^post4, (N^0-N^post4 == 0 /\ -x^post4+x^0 == 0 /\ -i^post4+i^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 5: l5 -> l6 : N^0'=N^post5, tmp^0'=tmp^post5, i^0'=i^post5, x^0'=x^post5, (N^0-N^post5 == 0 /\ tmp^post5 == 0 /\ -x^post5+x^0 == 0 /\ -i^post5+i^0 == 0), cost: 1 9: l6 -> l8 : N^0'=N^post9, tmp^0'=tmp^post9, i^0'=i^post9, x^0'=x^post9, (-tmp^post9+tmp^0 == 0 /\ N^0-N^post9 == 0 /\ -x^post9+x^0 == 0 /\ -i^post9+i^0 == 0), cost: 1 6: l7 -> l5 : N^0'=N^post6, tmp^0'=tmp^post6, i^0'=i^post6, x^0'=x^post6, (tmp^0-tmp^post6 == 0 /\ 2+N^0-x^0 <= 0 /\ x^0-x^post6 == 0 /\ N^0-N^post6 == 0 /\ -i^post6+i^0 == 0), cost: 1 7: l7 -> l5 : N^0'=N^post7, tmp^0'=tmp^post7, i^0'=i^post7, x^0'=x^post7, (N^0-N^post7 == 0 /\ -N^0+x^0 <= 0 /\ i^0-i^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ -x^post7+x^0 == 0), cost: 1 8: l7 -> l6 : N^0'=N^post8, tmp^0'=tmp^post8, i^0'=i^post8, x^0'=x^post8, (1+N^0-x^0 <= 0 /\ -x^post8+x^0 == 0 /\ -i^post8+i^0 == 0 /\ N^0-N^post8 == 0 /\ -1+tmp^post8 == 0 /\ -1-N^0+x^0 <= 0), cost: 1 14: l9 -> l4 : N^0'=N^post14, tmp^0'=tmp^post14, i^0'=i^post14, x^0'=x^post14, (i^post14 == 0 /\ N^0-N^post14 == 0 /\ -tmp^post14+tmp^0 == 0 /\ x^post14 == 0), cost: 1 15: l10 -> l9 : N^0'=N^post15, tmp^0'=tmp^post15, i^0'=i^post15, x^0'=x^post15, (-x^post15+x^0 == 0 /\ -i^post15+i^0 == 0 /\ tmp^0-tmp^post15 == 0 /\ N^0-N^post15 == 0), cost: 1 Removed unreachable rules and leafs Start location: l10 0: l0 -> l1 : N^0'=N^post0, tmp^0'=tmp^post0, i^0'=i^post0, x^0'=x^post0, (i^0-i^post0 == 0 /\ -2+x^post0-x^0 == 0 /\ N^0-N^post0 == 0 /\ tmp^0-tmp^post0 == 0), cost: 1 1: l0 -> l1 : N^0'=N^post1, tmp^0'=tmp^post1, i^0'=i^post1, x^0'=x^post1, (-i^post1+i^0 == 0 /\ N^0-N^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ -x^post1+x^0 == 0), cost: 1 13: l1 -> l4 : N^0'=N^post13, tmp^0'=tmp^post13, i^0'=i^post13, x^0'=x^post13, (-1+i^post13-i^0 == 0 /\ -x^post13+x^0 == 0 /\ N^0-N^post13 == 0 /\ tmp^0-tmp^post13 == 0), cost: 1 3: l2 -> l0 : N^0'=N^post3, tmp^0'=tmp^post3, i^0'=i^post3, x^0'=x^post3, (N^0-N^post3 == 0 /\ 1-N^0+i^0 <= 0 /\ tmp^0-tmp^post3 == 0 /\ i^0-i^post3 == 0 /\ -x^post3+x^0 == 0), cost: 1 4: l4 -> l2 : N^0'=N^post4, tmp^0'=tmp^post4, i^0'=i^post4, x^0'=x^post4, (N^0-N^post4 == 0 /\ -x^post4+x^0 == 0 /\ -i^post4+i^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 14: l9 -> l4 : N^0'=N^post14, tmp^0'=tmp^post14, i^0'=i^post14, x^0'=x^post14, (i^post14 == 0 /\ N^0-N^post14 == 0 /\ -tmp^post14+tmp^0 == 0 /\ x^post14 == 0), cost: 1 15: l10 -> l9 : N^0'=N^post15, tmp^0'=tmp^post15, i^0'=i^post15, x^0'=x^post15, (-x^post15+x^0 == 0 /\ -i^post15+i^0 == 0 /\ tmp^0-tmp^post15 == 0 /\ N^0-N^post15 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : N^0'=N^post0, tmp^0'=tmp^post0, i^0'=i^post0, x^0'=x^post0, (i^0-i^post0 == 0 /\ -2+x^post0-x^0 == 0 /\ N^0-N^post0 == 0 /\ tmp^0-tmp^post0 == 0), cost: 1 New rule: l0 -> l1 : x^0'=2+x^0, TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l1 : N^0'=N^post1, tmp^0'=tmp^post1, i^0'=i^post1, x^0'=x^post1, (-i^post1+i^0 == 0 /\ N^0-N^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ -x^post1+x^0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : N^0'=N^post3, tmp^0'=tmp^post3, i^0'=i^post3, x^0'=x^post3, (N^0-N^post3 == 0 /\ 1-N^0+i^0 <= 0 /\ tmp^0-tmp^post3 == 0 /\ i^0-i^post3 == 0 /\ -x^post3+x^0 == 0), cost: 1 New rule: l2 -> l0 : 1-N^0+i^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l2 : N^0'=N^post4, tmp^0'=tmp^post4, i^0'=i^post4, x^0'=x^post4, (N^0-N^post4 == 0 /\ -x^post4+x^0 == 0 /\ -i^post4+i^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 New rule: l4 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l4 : N^0'=N^post13, tmp^0'=tmp^post13, i^0'=i^post13, x^0'=x^post13, (-1+i^post13-i^0 == 0 /\ -x^post13+x^0 == 0 /\ N^0-N^post13 == 0 /\ tmp^0-tmp^post13 == 0), cost: 1 New rule: l1 -> l4 : i^0'=1+i^0, TRUE, cost: 1 Applied preprocessing Original rule: l9 -> l4 : N^0'=N^post14, tmp^0'=tmp^post14, i^0'=i^post14, x^0'=x^post14, (i^post14 == 0 /\ N^0-N^post14 == 0 /\ -tmp^post14+tmp^0 == 0 /\ x^post14 == 0), cost: 1 New rule: l9 -> l4 : i^0'=0, x^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l10 -> l9 : N^0'=N^post15, tmp^0'=tmp^post15, i^0'=i^post15, x^0'=x^post15, (-x^post15+x^0 == 0 /\ -i^post15+i^0 == 0 /\ tmp^0-tmp^post15 == 0 /\ N^0-N^post15 == 0), cost: 1 New rule: l10 -> l9 : TRUE, cost: 1 Simplified rules Start location: l10 16: l0 -> l1 : x^0'=2+x^0, TRUE, cost: 1 17: l0 -> l1 : TRUE, cost: 1 20: l1 -> l4 : i^0'=1+i^0, TRUE, cost: 1 18: l2 -> l0 : 1-N^0+i^0 <= 0, cost: 1 19: l4 -> l2 : TRUE, cost: 1 21: l9 -> l4 : i^0'=0, x^0'=0, TRUE, cost: 1 22: l10 -> l9 : TRUE, cost: 1 Eliminating location l9 by chaining: Applied chaining First rule: l10 -> l9 : TRUE, cost: 1 Second rule: l9 -> l4 : i^0'=0, x^0'=0, TRUE, cost: 1 New rule: l10 -> l4 : i^0'=0, x^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 21 22 Eliminating location l2 by chaining:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS