details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	1.17772293091 seconds
cpu usage	1.175150058
max memory	4.6600192E7

stage attributes

key	value
output-size	6734
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: __init 0: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ -4+arg2 > 0), cost: 1 1: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1-arg2 == 0 /\ 1+arg2 > 0 /\ -5+arg2 < 0), cost: 1 2: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1P2, arg2'=arg2P2, (arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -1 < 0), cost: 1 3: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0 /\ -1 < 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ -4+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ -4+arg2 > 0), cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1-arg2 == 0 /\ 1+arg2 > 0 /\ -5+arg2 < 0), cost: 1 New rule: f1_0_main_Load -> f86_0_sum_NE : arg1'=-arg2, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0 /\ 5-arg2 > 0), cost: 1 Applied preprocessing Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1P2, arg2'=arg2P2, (arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -1 < 0), cost: 1 New rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P2, -arg1 > 0, cost: 1 Applied preprocessing Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0 /\ -1 < 0), cost: 1 New rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P3, arg1 > 0, cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ -4+arg2 > 0), cost: 1 6: f1_0_main_Load -> f86_0_sum_NE : arg1'=-arg2, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0 /\ 5-arg2 > 0), cost: 1 7: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P2, -arg1 > 0, cost: 1 8: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P3, arg1 > 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied nonterm Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P2, -arg1 > 0, cost: 1 New rule: f86_0_sum_NE -> [3] : -arg1 > 0, cost: NONTERM Applied acceleration Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P2, -arg1 > 0, cost: 1 New rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1-n1, arg2'=arg2P2, -arg1 > 0, cost: n1 Applied acceleration Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=-1+arg1, arg2'=arg2P3, arg1 > 0, cost: 1 New rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1-n3, arg2'=arg2P3, (-1+n3 >= 0 /\ 1+arg1-n3 > 0), cost: n3 Applied instantiation Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1-n3, arg2'=arg2P3, (-1+n3 >= 0 /\ 1+arg1-n3 > 0), cost: n3 New rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=0, arg2'=arg2P3, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 Applied simplification Original rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=0, arg2'=arg2P3, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 New rule: f86_0_sum_NE -> f86_0_sum_NE : arg1'=0, arg2'=arg2P3, -1+arg1 >= 0, cost: arg1 Applied deletion Removed the following rules: 7 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f86_0_sum_NE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ -4+arg2 > 0), cost: 1 6: f1_0_main_Load -> f86_0_sum_NE : arg1'=-arg2, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0 /\ 5-arg2 > 0), cost: 1 9: f86_0_sum_NE -> [3] : -arg1 > 0, cost: NONTERM 10: f86_0_sum_NE -> f86_0_sum_NE : arg1'=arg1-n1, arg2'=arg2P2, -arg1 > 0, cost: n1 12: f86_0_sum_NE -> f86_0_sum_NE : arg1'=0, arg2'=arg2P3, -1+arg1 >= 0, cost: arg1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f86_0_sum_NE : arg1'=-arg2, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0 /\ 5-arg2 > 0), cost: 1 Second rule: f86_0_sum_NE -> [3] : -arg1 > 0, cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ arg2 > 0 /\ 5-arg2 > 0), cost: NONTERM popout

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

job log

popout

actions

all output return to Integer Transition Systems