details

property	value
status	complete
benchmark	Avg.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n082.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.144759178162 seconds
cpu usage	0.143811081
max memory	1.2955648E7

stage attributes

key	value
output-size	4981
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 1: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1P1, arg2'=arg2P1, (1 > 0 /\ 1+arg1 > 0 /\ arg2 > 0 /\ 1+arg1-arg1P1 == 0 /\ -1 < 0 /\ -1-arg2P1+arg2 == 0), cost: 1 2: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1P2, arg2'=arg2P2, (-2 < 0 /\ 1-arg2P2 == 0 /\ -arg2 == 0 /\ -2+arg1-arg1P2 == 0 /\ -2+arg1 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1P1, arg2'=arg2P1, (1 > 0 /\ 1+arg1 > 0 /\ arg2 > 0 /\ 1+arg1-arg1P1 == 0 /\ -1 < 0 /\ -1-arg2P1+arg2 == 0), cost: 1 New rule: f127_0_average_LE -> f127_0_average_LE : arg1'=1+arg1, arg2'=-1+arg2, (1+arg1 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1P2, arg2'=arg2P2, (-2 < 0 /\ 1-arg2P2 == 0 /\ -arg2 == 0 /\ -2+arg1-arg1P2 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, (arg2 == 0 /\ -2+arg1 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 4: f127_0_average_LE -> f127_0_average_LE : arg1'=1+arg1, arg2'=-1+arg2, (1+arg1 > 0 /\ arg2 > 0), cost: 1 5: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, (arg2 == 0 /\ -2+arg1 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied acceleration Original rule: f127_0_average_LE -> f127_0_average_LE : arg1'=1+arg1, arg2'=-1+arg2, (1+arg1 > 0 /\ arg2 > 0), cost: 1 New rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+n1, arg2'=-n1+arg2, (n1 >= 0 /\ 1+arg1 > 0 /\ 1-n1+arg2 > 0), cost: n1 Applied instantiation Original rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+n1, arg2'=-n1+arg2, (n1 >= 0 /\ 1+arg1 > 0 /\ 1-n1+arg2 > 0), cost: n1 New rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+arg2, arg2'=0, (1 > 0 /\ 1+arg1 > 0 /\ arg2 >= 0), cost: arg2 Applied simplification Original rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+arg2, arg2'=0, (1 > 0 /\ 1+arg1 > 0 /\ arg2 >= 0), cost: arg2 New rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+arg2, arg2'=0, (1+arg1 > 0 /\ arg2 >= 0), cost: arg2 Applied deletion Removed the following rules: 4 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 5: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, (arg2 == 0 /\ -2+arg1 > 0), cost: 1 7: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+arg2, arg2'=0, (1+arg1 > 0 /\ arg2 >= 0), cost: arg2 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Second rule: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, (arg2 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f1_0_main_Load -> f127_0_average_LE : arg1'=-2+arg1P0, arg2'=1, (arg1 > 0 /\ -2+arg1P0 > 0 /\ -1+arg2 > 0), cost: 2 Applied chaining First rule: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Second rule: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1+arg2, arg2'=0, (1+arg1 > 0 /\ arg2 >= 0), cost: arg2 New rule: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0+arg2P0, arg2'=0, (arg1 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0 /\ arg2P0 >= 0), cost: 1+arg2P0 Applied deletion Removed the following rules: 5 7 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 8: f1_0_main_Load -> f127_0_average_LE : arg1'=-2+arg1P0, arg2'=1, (arg1 > 0 /\ -2+arg1P0 > 0 /\ -1+arg2 > 0), cost: 2 9: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P0+arg2P0, arg2'=0, (arg1 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0 /\ arg2P0 >= 0), cost: 1+arg2P0 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> Computing asymptotic complexity Proved the following lower bound popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integer Transition Systems