Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099290
details
property
value
status
complete
benchmark
Et1.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.124187 seconds
cpu usage
0.125119
user time
0.099347
system time
0.025772
max virtual memory
113188.0
max residence set size
28464.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_Load -> f210_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ -arg2P0-x30 == 0 /\ -arg1P0-x20 == 0 /\ 1+x30 > 0), cost: 1 1: f210_0_main_LE -> f210_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (1+arg1-arg1P1 == 0 /\ -arg1+arg2 < 0 /\ arg1-arg2P1+arg2 == 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f210_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ -arg2P0-x30 == 0 /\ -arg1P0-x20 == 0 /\ 1+x30 > 0), cost: 1 New rule: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20, arg2'=-x30, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ 1+x30 > 0), cost: 1 Applied preprocessing Original rule: f210_0_main_LE -> f210_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (1+arg1-arg1P1 == 0 /\ -arg1+arg2 < 0 /\ arg1-arg2P1+arg2 == 0), cost: 1 New rule: f210_0_main_LE -> f210_0_main_LE : arg1'=1+arg1, arg2'=arg1+arg2, arg1-arg2 > 0, cost: 1 Simplified rules Start location: __init 3: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20, arg2'=-x30, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ 1+x30 > 0), cost: 1 4: f210_0_main_LE -> f210_0_main_LE : arg1'=1+arg1, arg2'=arg1+arg2, arg1-arg2 > 0, cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied acceleration Original rule: f210_0_main_LE -> f210_0_main_LE : arg1'=1+arg1, arg2'=arg1+arg2, arg1-arg2 > 0, cost: 1 New rule: f210_0_main_LE -> f210_0_main_LE : arg1'=arg1+n0, arg2'=arg1*n0+arg2-1/2*n0+1/2*n0^2, (n0 >= 0 /\ arg1-arg2 > 0 /\ -3/2+arg1-arg1*(-1+n0)-arg2+3/2*n0-1/2*(-1+n0)^2 > 0), cost: n0 Applied deletion Removed the following rules: 4 Accelerated simple loops Start location: __init 3: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20, arg2'=-x30, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ 1+x30 > 0), cost: 1 5: f210_0_main_LE -> f210_0_main_LE : arg1'=arg1+n0, arg2'=arg1*n0+arg2-1/2*n0+1/2*n0^2, (n0 >= 0 /\ arg1-arg2 > 0 /\ -3/2+arg1-arg1*(-1+n0)-arg2+3/2*n0-1/2*(-1+n0)^2 > 0), cost: n0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20, arg2'=-x30, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ 1+x30 > 0), cost: 1 Second rule: f210_0_main_LE -> f210_0_main_LE : arg1'=arg1+n0, arg2'=arg1*n0+arg2-1/2*n0+1/2*n0^2, (n0 >= 0 /\ arg1-arg2 > 0 /\ -3/2+arg1-arg1*(-1+n0)-arg2+3/2*n0-1/2*(-1+n0)^2 > 0), cost: n0 New rule: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20+n0, arg2'=-x20*n0-x30-1/2*n0+1/2*n0^2, (arg1 > 0 /\ 1+x20 > 0 /\ -3/2+(-1+n0)*x20-x20+x30+3/2*n0-1/2*(-1+n0)^2 > 0 /\ -1+arg2 > 0 /\ -x20+x30 > 0 /\ n0 >= 0), cost: 1+n0 Applied deletion Removed the following rules: 5 Chained accelerated rules with incoming rules Start location: __init 3: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20, arg2'=-x30, (arg1 > 0 /\ 1+x20 > 0 /\ -1+arg2 > 0 /\ 1+x30 > 0), cost: 1 6: f1_0_main_Load -> f210_0_main_LE : arg1'=-x20+n0, arg2'=-x20*n0-x30-1/2*n0+1/2*n0^2, (arg1 > 0 /\ 1+x20 > 0 /\ -3/2+(-1+n0)*x20-x20+x30+3/2*n0-1/2*(-1+n0)^2 > 0 /\ -1+arg2 > 0 /\ -x20+x30 > 0 /\ n0 >= 0), cost: 1+n0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, 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