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