details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0711178779602 seconds
cpu usage	0.025336803
max memory	1830912.0

stage attributes

key	value
output-size	2466
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: __init 0: f58_0_m_Load -> f58_0_m_Load : TRUE, cost: 1 1: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1 2: __init -> f1_0_main_New : TRUE, cost: 1 Applied nonterm Original rule: f58_0_m_Load -> f58_0_m_Load : TRUE, cost: 1 New rule: f58_0_m_Load -> [3] : TRUE, cost: NONTERM Applied acceleration Original rule: f58_0_m_Load -> f58_0_m_Load : TRUE, cost: 1 New rule: f58_0_m_Load -> f58_0_m_Load : TRUE, cost: n0 Applied deletion Removed the following rules: 0 Accelerated simple loops Start location: __init 3: f58_0_m_Load -> [3] : TRUE, cost: NONTERM 4: f58_0_m_Load -> f58_0_m_Load : TRUE, cost: n0 1: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1 2: __init -> f1_0_main_New : TRUE, cost: 1 Applied chaining First rule: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1 Second rule: f58_0_m_Load -> [3] : TRUE, cost: NONTERM New rule: f1_0_main_New -> [3] : TRUE, cost: NONTERM Applied chaining First rule: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1 Second rule: f58_0_m_Load -> f58_0_m_Load : TRUE, cost: n0 New rule: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1+n0 Applied deletion Removed the following rules: 3 4 Chained accelerated rules with incoming rules Start location: __init 1: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1 5: f1_0_main_New -> [3] : TRUE, cost: NONTERM 6: f1_0_main_New -> f58_0_m_Load : TRUE, cost: 1+n0 2: __init -> f1_0_main_New : TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 5: f1_0_main_New -> [3] : TRUE, cost: NONTERM 2: __init -> f1_0_main_New : TRUE, cost: 1 Eliminating location f1_0_main_New by chaining: Applied chaining First rule: __init -> f1_0_main_New : TRUE, cost: 1 Second rule: f1_0_main_New -> [3] : TRUE, cost: NONTERM New rule: __init -> [3] : TRUE, cost: NONTERM Applied deletion Removed the following rules: 2 5 Eliminated locations on linear paths Start location: __init 7: __init -> [3] : TRUE, cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 7 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: TRUE popout

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

job log

popout

actions

all output return to Integer Transition Systems