Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099800
details
property
value
status
complete
benchmark
Exc.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.261414 seconds
cpu usage
0.264951
user time
0.232822
system time
0.032129
max virtual memory
113188.0
max residence set size
29028.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_New -> f83_0_main_GE : arg1'=arg1P0, -arg1P0 == 0, cost: 1 1: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1P1, (2+arg1-arg1P1 == 0 /\ -20+arg1 < 0 /\ -11+arg1 < 0), cost: 1 2: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1P2, (-10+arg1 > 0 /\ 2+arg1-arg1P2 == 0 /\ -20+arg1 < 0), cost: 1 3: __init -> f1_0_main_New : arg1'=arg1P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_New -> f83_0_main_GE : arg1'=arg1P0, -arg1P0 == 0, cost: 1 New rule: f1_0_main_New -> f83_0_main_GE : arg1'=0, TRUE, cost: 1 Applied preprocessing Original rule: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1P1, (2+arg1-arg1P1 == 0 /\ -20+arg1 < 0 /\ -11+arg1 < 0), cost: 1 New rule: f83_0_main_GE -> f83_0_main_GE : arg1'=2+arg1, 11-arg1 > 0, cost: 1 Applied preprocessing Original rule: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1P2, (-10+arg1 > 0 /\ 2+arg1-arg1P2 == 0 /\ -20+arg1 < 0), cost: 1 New rule: f83_0_main_GE -> f83_0_main_GE : arg1'=2+arg1, (20-arg1 > 0 /\ -10+arg1 > 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_New -> f83_0_main_GE : arg1'=0, TRUE, cost: 1 5: f83_0_main_GE -> f83_0_main_GE : arg1'=2+arg1, 11-arg1 > 0, cost: 1 6: f83_0_main_GE -> f83_0_main_GE : arg1'=2+arg1, (20-arg1 > 0 /\ -10+arg1 > 0), cost: 1 3: __init -> f1_0_main_New : arg1'=arg1P3, TRUE, cost: 1 Applied acceleration Original rule: f83_0_main_GE -> f83_0_main_GE : arg1'=2+arg1, 11-arg1 > 0, cost: 1 New rule: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1+2*n1, (n1 >= 0 /\ 13-arg1-2*n1 > 0), cost: n1 Applied acceleration Original rule: f83_0_main_GE -> f83_0_main_GE : arg1'=2+arg1, (20-arg1 > 0 /\ -10+arg1 > 0), cost: 1 New rule: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1+2*n3, (22-arg1-2*n3 > 0 /\ -10+arg1 > 0 /\ n3 >= 0), cost: n3 Applied deletion Removed the following rules: 5 6 Accelerated simple loops Start location: __init 4: f1_0_main_New -> f83_0_main_GE : arg1'=0, TRUE, cost: 1 7: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1+2*n1, (n1 >= 0 /\ 13-arg1-2*n1 > 0), cost: n1 8: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1+2*n3, (22-arg1-2*n3 > 0 /\ -10+arg1 > 0 /\ n3 >= 0), cost: n3 3: __init -> f1_0_main_New : arg1'=arg1P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_New -> f83_0_main_GE : arg1'=0, TRUE, cost: 1 Second rule: f83_0_main_GE -> f83_0_main_GE : arg1'=arg1+2*n1, (n1 >= 0 /\ 13-arg1-2*n1 > 0), cost: n1 New rule: f1_0_main_New -> f83_0_main_GE : arg1'=2*n1, (n1 >= 0 /\ 13-2*n1 > 0), cost: 1+n1 Applied deletion Removed the following rules: 7 8 Chained accelerated rules with incoming rules Start location: __init 4: f1_0_main_New -> f83_0_main_GE : arg1'=0, TRUE, cost: 1 9: f1_0_main_New -> f83_0_main_GE : arg1'=2*n1, (n1 >= 0 /\ 13-2*n1 > 0), cost: 1+n1 3: __init -> f1_0_main_New : arg1'=arg1P3, 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