Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098717
details
property
value
status
complete
benchmark
array_init.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.04701 seconds
cpu usage
0.047956
user time
0.031824
system time
0.016132
max virtual memory
113188.0
max residence set size
18344.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l6 0: l0 -> l1 : i^0'=i^post0, i^0-i^post0 == 0, cost: 1 1: l0 -> l1 : i^0'=i^post1, i^0-i^post1 == 0, cost: 1 5: l1 -> l4 : i^0'=i^post5, i^0-i^post5 == 0, cost: 1 2: l2 -> l0 : i^0'=i^post2, (i^0-i^post2 == 0 /\ 10-i^0 <= 0), cost: 1 3: l2 -> l3 : i^0'=i^post3, (-1-i^0+i^post3 == 0 /\ -9+i^0 <= 0), cost: 1 4: l3 -> l2 : i^0'=i^post4, i^0-i^post4 == 0, cost: 1 6: l5 -> l3 : i^0'=i^post6, i^post6 == 0, cost: 1 7: l6 -> l5 : i^0'=i^post7, i^0-i^post7 == 0, cost: 1 Removed unreachable rules and leafs Start location: l6 3: l2 -> l3 : i^0'=i^post3, (-1-i^0+i^post3 == 0 /\ -9+i^0 <= 0), cost: 1 4: l3 -> l2 : i^0'=i^post4, i^0-i^post4 == 0, cost: 1 6: l5 -> l3 : i^0'=i^post6, i^post6 == 0, cost: 1 7: l6 -> l5 : i^0'=i^post7, i^0-i^post7 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : i^0'=i^post3, (-1-i^0+i^post3 == 0 /\ -9+i^0 <= 0), cost: 1 New rule: l2 -> l3 : i^0'=1+i^0, -9+i^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i^0'=i^post4, i^0-i^post4 == 0, cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l3 : i^0'=i^post6, i^post6 == 0, cost: 1 New rule: l5 -> l3 : i^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l5 : i^0'=i^post7, i^0-i^post7 == 0, cost: 1 New rule: l6 -> l5 : TRUE, cost: 1 Simplified rules Start location: l6 8: l2 -> l3 : i^0'=1+i^0, -9+i^0 <= 0, cost: 1 9: l3 -> l2 : TRUE, cost: 1 10: l5 -> l3 : i^0'=0, TRUE, cost: 1 11: l6 -> l5 : TRUE, cost: 1 Eliminating location l5 by chaining: Applied chaining First rule: l6 -> l5 : TRUE, cost: 1 Second rule: l5 -> l3 : i^0'=0, TRUE, cost: 1 New rule: l6 -> l3 : i^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l2 by chaining: Applied chaining First rule: l3 -> l2 : TRUE, cost: 1 Second rule: l2 -> l3 : i^0'=1+i^0, -9+i^0 <= 0, cost: 1 New rule: l3 -> l3 : i^0'=1+i^0, -9+i^0 <= 0, cost: 2 Applied deletion Removed the following rules: 8 9 Eliminated locations on linear paths Start location: l6 13: l3 -> l3 : i^0'=1+i^0, -9+i^0 <= 0, cost: 2 12: l6 -> l3 : i^0'=0, TRUE, cost: 2 Applied acceleration Original rule: l3 -> l3 : i^0'=1+i^0, -9+i^0 <= 0, cost: 2 New rule: l3 -> l3 : i^0'=i^0+n0, (n0 >= 0 /\ 10-i^0-n0 >= 0), cost: 2*n0 Applied instantiation Original rule: l3 -> l3 : i^0'=i^0+n0, (n0 >= 0 /\ 10-i^0-n0 >= 0), cost: 2*n0 New rule: l3 -> l3 : i^0'=10, (0 >= 0 /\ 10-i^0 >= 0), cost: 20-2*i^0 Applied simplification Original rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS