details

property	value
status	complete
benchmark	Velroyen08-cousot.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.948325157166 seconds
cpu usage	0.947512692
max memory	2.4408064E7

stage attributes

key	value
output-size	6127
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 -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 1: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1P1, arg2'=arg2P1, (-arg2P1+arg2 == 0 /\ 4+arg1-arg1P1 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 2: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1 > 0 /\ 1-arg2P2+arg2 == 0 /\ -arg1+arg2 <= 0 /\ 1+arg2 > 0 /\ 2+arg1-arg1P2 == 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1P1, arg2'=arg2P1, (-arg2P1+arg2 == 0 /\ 4+arg1-arg1P1 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 New rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=4+arg1, (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1 > 0 /\ 1-arg2P2+arg2 == 0 /\ -arg1+arg2 <= 0 /\ 1+arg2 > 0 /\ 2+arg1-arg1P2 == 0), cost: 1 New rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=2+arg1, arg2'=1+arg2, (-arg1+arg2 <= 0 /\ 1+arg2 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 4: f112_0_loop_GE -> f112_0_loop_GE : arg1'=4+arg1, (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 5: f112_0_loop_GE -> f112_0_loop_GE : arg1'=2+arg1, arg2'=1+arg2, (-arg1+arg2 <= 0 /\ 1+arg2 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied acceleration Original rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=4+arg1, (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 New rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1+4*n1, (n1 >= 0 /\ 4-arg1-4*n1+arg2 > 0 /\ 1+arg1 > 0), cost: n1 Applied nonterm Original rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=2+arg1, arg2'=1+arg2, (-arg1+arg2 <= 0 /\ 1+arg2 > 0), cost: 1 New rule: f112_0_loop_GE -> [3] : (1+arg2 > 0 /\ arg1-arg2 >= 0), cost: NONTERM Applied acceleration Original rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=2+arg1, arg2'=1+arg2, (-arg1+arg2 <= 0 /\ 1+arg2 > 0), cost: 1 New rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1+2*n3, arg2'=n3+arg2, (1+arg2 > 0 /\ arg1-arg2 >= 0), cost: n3 Applied deletion Removed the following rules: 4 5 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 6: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1+4*n1, (n1 >= 0 /\ 4-arg1-4*n1+arg2 > 0 /\ 1+arg1 > 0), cost: n1 7: f112_0_loop_GE -> [3] : (1+arg2 > 0 /\ arg1-arg2 >= 0), cost: NONTERM 8: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1+2*n3, arg2'=n3+arg2, (1+arg2 > 0 /\ arg1-arg2 >= 0), cost: n3 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Second rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1+4*n1, (n1 >= 0 /\ 4-arg1-4*n1+arg2 > 0 /\ 1+arg1 > 0), cost: n1 New rule: f1_0_main_Load -> f112_0_loop_GE : arg1'=4*n1+arg1P0, arg2'=arg2P0, (arg1 > 0 /\ n1 >= 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0 /\ 4-4*n1-arg1P0+arg2P0 > 0), cost: 1+n1 Applied chaining First rule: f1_0_main_Load -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Second rule: f112_0_loop_GE -> [3] : (1+arg2 > 0 /\ arg1-arg2 >= 0), cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Second rule: f112_0_loop_GE -> f112_0_loop_GE : arg1'=arg1+2*n3, arg2'=n3+arg2, (1+arg2 > 0 /\ arg1-arg2 >= 0), cost: n3 New rule: f1_0_main_Load -> f112_0_loop_GE : arg1'=2*n3+arg1P0, arg2'=n3+arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ arg1P0-arg2P0 >= 0), cost: 1+n3 Applied deletion Removed the following rules: 6 7 8 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f112_0_loop_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 9: f1_0_main_Load -> f112_0_loop_GE : arg1'=4*n1+arg1P0, arg2'=arg2P0, (arg1 > 0 /\ n1 >= 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ 1+arg1P0 > 0 /\ 4-4*n1-arg1P0+arg2P0 > 0), cost: 1+n1 10: f1_0_main_Load -> [3] : (arg1 > 0 /\ -1+arg2 > 0), cost: NONTERM 11: f1_0_main_Load -> f112_0_loop_GE : arg1'=2*n3+arg1P0, arg2'=n3+arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ -1+arg2 > 0 /\ arg1P0-arg2P0 >= 0), cost: 1+n3 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 popout

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

job log

popout

actions

all output return to Integer Transition Systems