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