Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099209
details
property
value
status
complete
benchmark
Double2.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0366431 seconds
cpu usage
0.037407
user time
0.02513
system time
0.012277
max virtual memory
113188.0
max residence set size
18200.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=arg1P0, 9-arg1P0 == 0, cost: 1 1: f80_0_test_LT -> f80_0_test_LT : arg1'=arg1P1, (-1+arg1-arg1P1 == 0 /\ 1+arg1 > 0), cost: 1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=arg1P0, 9-arg1P0 == 0, cost: 1 New rule: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=9, TRUE, cost: 1 Applied preprocessing Original rule: f80_0_test_LT -> f80_0_test_LT : arg1'=arg1P1, (-1+arg1-arg1P1 == 0 /\ 1+arg1 > 0), cost: 1 New rule: f80_0_test_LT -> f80_0_test_LT : arg1'=-1+arg1, 1+arg1 > 0, cost: 1 Simplified rules Start location: __init 3: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=9, TRUE, cost: 1 4: f80_0_test_LT -> f80_0_test_LT : arg1'=-1+arg1, 1+arg1 > 0, cost: 1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, TRUE, cost: 1 Applied acceleration Original rule: f80_0_test_LT -> f80_0_test_LT : arg1'=-1+arg1, 1+arg1 > 0, cost: 1 New rule: f80_0_test_LT -> f80_0_test_LT : arg1'=arg1-n0, (n0 >= 0 /\ 2+arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f80_0_test_LT -> f80_0_test_LT : arg1'=arg1-n0, (n0 >= 0 /\ 2+arg1-n0 > 0), cost: n0 New rule: f80_0_test_LT -> f80_0_test_LT : arg1'=-1, (1 > 0 /\ 1+arg1 >= 0), cost: 1+arg1 Applied simplification Original rule: f80_0_test_LT -> f80_0_test_LT : arg1'=-1, (1 > 0 /\ 1+arg1 >= 0), cost: 1+arg1 New rule: f80_0_test_LT -> f80_0_test_LT : arg1'=-1, 1+arg1 >= 0, cost: 1+arg1 Applied deletion Removed the following rules: 4 Accelerated simple loops Start location: __init 3: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=9, TRUE, cost: 1 6: f80_0_test_LT -> f80_0_test_LT : arg1'=-1, 1+arg1 >= 0, cost: 1+arg1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=9, TRUE, cost: 1 Second rule: f80_0_test_LT -> f80_0_test_LT : arg1'=-1, 1+arg1 >= 0, cost: 1+arg1 New rule: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=-1, 10 >= 0, cost: 11 Applied deletion Removed the following rules: 6 Chained accelerated rules with incoming rules Start location: __init 3: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=9, TRUE, cost: 1 7: f1_0_main_ConstantStackPush -> f80_0_test_LT : arg1'=-1, 10 >= 0, cost: 11 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ? Solved cost: 0 Rule cost: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS