details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	1.45741 seconds
cpu usage	1.46595
user time	1.39222
system time	0.073729
max virtual memory	280376.0
max residence set size	35812.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 < 0 /\ -1+arg1 < 0 /\ 2+arg1-arg1P1 == 0 /\ 3+arg1 > 0), cost: 1 2: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -3+arg1 < 0 /\ -2+arg1-arg1P2 == 0), cost: 1 3: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (1-arg1 < 0 /\ 2-arg1-arg1P3 == 0 /\ -2+arg1 > 0), cost: 1 4: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P4, arg2'=arg2P4, (arg1 < 0 /\ -1+arg1 < 0 /\ 1+arg1 < 0 /\ -2-arg1-arg1P4 == 0 /\ 3+arg1 <= 0 /\ 2+arg1 < 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 < 0 /\ -1+arg1 < 0 /\ 2+arg1-arg1P1 == 0 /\ 3+arg1 > 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1 Applied preprocessing Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -3+arg1 < 0 /\ -2+arg1-arg1P2 == 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1 Applied preprocessing Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (1-arg1 < 0 /\ 2-arg1-arg1P3 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2-arg1, arg2'=arg2P3, -2+arg1 > 0, cost: 1 Applied preprocessing Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1P4, arg2'=arg2P4, (arg1 < 0 /\ -1+arg1 < 0 /\ 1+arg1 < 0 /\ -2-arg1-arg1P4 == 0 /\ 3+arg1 <= 0 /\ 2+arg1 < 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2-arg1, arg2'=arg2P4, -2-arg1 > 0, cost: 1 Simplified rules Start location: __init 6: f1_0_main_Load -> f98_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1 8: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1 9: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2-arg1, arg2'=arg2P3, -2+arg1 > 0, cost: 1 10: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2-arg1, arg2'=arg2P4, -2-arg1 > 0, cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied acceleration Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1+2*n3, arg2'=arg2P1, (-arg1 > 0 /\ -1+n3 >= 0 /\ 2-arg1-2*n3 > 0 /\ 3+arg1 > 0), cost: n3 Applied acceleration Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=arg1-2*n5, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0 /\ -1+n5 >= 0 /\ 2+arg1-2*n5 > 0), cost: n5 Applied chaining First rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1 Second rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, 1+arg1 == 0, cost: 2 Applied nonterm Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, 1+arg1 == 0, cost: 2 New rule: f98_0_loop_EQ -> [3] : (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: NONTERM Applied acceleration Original rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, 1+arg1 == 0, cost: 2 New rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: 2*n7 Applied chaining First rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1 Second rule: f98_0_loop_EQ -> [3] : (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: NONTERM New rule: f98_0_loop_EQ -> [3] : (arg1 > 0 /\ 3-arg1 > 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0), cost: NONTERM Heuristically decided not to add the following rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg2'=arg2P2, (1+arg1 >= 0 /\ -1-arg1 >= 0), cost: 2*n7 Applied chaining First rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=-2+arg1, arg2'=arg2P2, (arg1 > 0 /\ 3-arg1 > 0), cost: 1 Second rule: f98_0_loop_EQ -> f98_0_loop_EQ : arg1'=2+arg1, arg2'=arg2P1, (-arg1 > 0 /\ 3+arg1 > 0), cost: 1 popout

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

job log

popout

actions

all output return to ITS