Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097646
details
property
value
status
complete
benchmark
afagx1.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.082349 seconds
cpu usage
0.08408
user time
0.066209
system time
0.017871
max virtual memory
113188.0
max residence set size
8008.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l8 0: l0 -> l1 : tmp2^0'=tmp2^post0, x^0'=x^post0, (x^0-x^post0 == 0 /\ tmp2^0-tmp2^post0 == 0), cost: 1 4: l1 -> l2 : tmp2^0'=tmp2^post4, x^0'=x^post4, (0 == 0 /\ -x^post4+x^0 == 0), cost: 1 1: l2 -> l3 : tmp2^0'=tmp2^post1, x^0'=x^post1, (tmp2^0 <= 0 /\ -tmp2^0 <= 0 /\ x^10 == 0 /\ tmp2^0-tmp2^post1 == 0 /\ -1+x^post1 == 0), cost: 1 2: l2 -> l0 : tmp2^0'=tmp2^post2, x^0'=x^post2, (1-tmp2^0 <= 0 /\ x^0-x^post2 == 0 /\ tmp2^0-tmp2^post2 == 0), cost: 1 3: l2 -> l0 : tmp2^0'=tmp2^post3, x^0'=x^post3, (tmp2^0-tmp2^post3 == 0 /\ 1+tmp2^0 <= 0 /\ -x^post3+x^0 == 0), cost: 1 5: l3 -> l4 : tmp2^0'=tmp2^post5, x^0'=x^post5, (x^0-x^post5 == 0 /\ tmp2^0-tmp2^post5 == 0), cost: 1 6: l4 -> l3 : tmp2^0'=tmp2^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ tmp2^0-tmp2^post6 == 0), cost: 1 7: l5 -> l6 : tmp2^0'=tmp2^post7, x^0'=x^post7, (tmp2^0-tmp2^post7 == 0 /\ -x^post7+x^0 == 0), cost: 1 8: l7 -> l1 : tmp2^0'=tmp2^post8, x^0'=x^post8, (-1+x^post8 == 0 /\ tmp2^0-tmp2^post8 == 0), cost: 1 9: l8 -> l7 : tmp2^0'=tmp2^post9, x^0'=x^post9, (-x^post9+x^0 == 0 /\ tmp2^0-tmp2^post9 == 0), cost: 1 Removed unreachable rules and leafs Start location: l8 0: l0 -> l1 : tmp2^0'=tmp2^post0, x^0'=x^post0, (x^0-x^post0 == 0 /\ tmp2^0-tmp2^post0 == 0), cost: 1 4: l1 -> l2 : tmp2^0'=tmp2^post4, x^0'=x^post4, (0 == 0 /\ -x^post4+x^0 == 0), cost: 1 1: l2 -> l3 : tmp2^0'=tmp2^post1, x^0'=x^post1, (tmp2^0 <= 0 /\ -tmp2^0 <= 0 /\ x^10 == 0 /\ tmp2^0-tmp2^post1 == 0 /\ -1+x^post1 == 0), cost: 1 2: l2 -> l0 : tmp2^0'=tmp2^post2, x^0'=x^post2, (1-tmp2^0 <= 0 /\ x^0-x^post2 == 0 /\ tmp2^0-tmp2^post2 == 0), cost: 1 3: l2 -> l0 : tmp2^0'=tmp2^post3, x^0'=x^post3, (tmp2^0-tmp2^post3 == 0 /\ 1+tmp2^0 <= 0 /\ -x^post3+x^0 == 0), cost: 1 5: l3 -> l4 : tmp2^0'=tmp2^post5, x^0'=x^post5, (x^0-x^post5 == 0 /\ tmp2^0-tmp2^post5 == 0), cost: 1 6: l4 -> l3 : tmp2^0'=tmp2^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ tmp2^0-tmp2^post6 == 0), cost: 1 8: l7 -> l1 : tmp2^0'=tmp2^post8, x^0'=x^post8, (-1+x^post8 == 0 /\ tmp2^0-tmp2^post8 == 0), cost: 1 9: l8 -> l7 : tmp2^0'=tmp2^post9, x^0'=x^post9, (-x^post9+x^0 == 0 /\ tmp2^0-tmp2^post9 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : tmp2^0'=tmp2^post0, x^0'=x^post0, (x^0-x^post0 == 0 /\ tmp2^0-tmp2^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l3 : tmp2^0'=tmp2^post1, x^0'=x^post1, (tmp2^0 <= 0 /\ -tmp2^0 <= 0 /\ x^10 == 0 /\ tmp2^0-tmp2^post1 == 0 /\ -1+x^post1 == 0), cost: 1 New rule: l2 -> l3 : x^0'=1, tmp2^0 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : tmp2^0'=tmp2^post2, x^0'=x^post2, (1-tmp2^0 <= 0 /\ x^0-x^post2 == 0 /\ tmp2^0-tmp2^post2 == 0), cost: 1 New rule: l2 -> l0 : -1+tmp2^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : tmp2^0'=tmp2^post3, x^0'=x^post3, (tmp2^0-tmp2^post3 == 0 /\ 1+tmp2^0 <= 0 /\ -x^post3+x^0 == 0), cost: 1 New rule: l2 -> l0 : 1+tmp2^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l2 : tmp2^0'=tmp2^post4, x^0'=x^post4, (0 == 0 /\ -x^post4+x^0 == 0), cost: 1 New rule: l1 -> l2 : tmp2^0'=tmp2^post4, 0 == 0, cost: 1 Applied preprocessing Original rule: l3 -> l4 : tmp2^0'=tmp2^post5, x^0'=x^post5, (x^0-x^post5 == 0 /\ tmp2^0-tmp2^post5 == 0), cost: 1 New rule: l3 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : tmp2^0'=tmp2^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ tmp2^0-tmp2^post6 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l1 : tmp2^0'=tmp2^post8, x^0'=x^post8, (-1+x^post8 == 0 /\ tmp2^0-tmp2^post8 == 0), cost: 1 New rule: l7 -> l1 : x^0'=1, TRUE, cost: 1 Applied preprocessing Original rule: l8 -> l7 : tmp2^0'=tmp2^post9, x^0'=x^post9, (-x^post9+x^0 == 0 /\ tmp2^0-tmp2^post9 == 0), cost: 1 New rule: l8 -> l7 : TRUE, cost: 1 Simplified rules Start location: l8 10: l0 -> l1 : TRUE, cost: 1 14: l1 -> l2 : tmp2^0'=tmp2^post4, 0 == 0, cost: 1 11: l2 -> l3 : x^0'=1, tmp2^0 == 0, cost: 1 12: l2 -> l0 : -1+tmp2^0 >= 0, cost: 1 13: l2 -> l0 : 1+tmp2^0 <= 0, cost: 1 15: l3 -> l4 : TRUE, cost: 1 16: l4 -> l3 : TRUE, cost: 1 17: l7 -> l1 : x^0'=1, TRUE, cost: 1 18: l8 -> l7 : TRUE, cost: 1 Eliminating location l7 by chaining: Applied chaining First rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS