details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0988211 seconds
cpu usage	0.100293
user time	0.082228
system time	0.018065
max virtual memory	113188.0
max residence set size	18428.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f32_0_increase_GE -> f32_0_increase_GE : arg1'=arg1P1, arg2'=arg2P1, (1 > 0 /\ -10+arg1 < 0 /\ 1+arg1 > 0 /\ 1+arg1-arg1P1 == 0), cost: 1 2: f32_0_increase_GE -> f95_0_increase_aux_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg1 < 0 /\ arg1-arg1P2 == 0), cost: 1 3: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=arg1P3, arg2'=arg2P3, (1 > 0 /\ 1+arg1-arg1P3 == 0 /\ -5+arg1 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=arg1P1, arg2'=arg2P1, (1 > 0 /\ -10+arg1 < 0 /\ 1+arg1 > 0 /\ 1+arg1-arg1P1 == 0), cost: 1 New rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=1+arg1, arg2'=arg2P1, (1+arg1 > 0 /\ 10-arg1 > 0), cost: 1 Applied preprocessing Original rule: f32_0_increase_GE -> f95_0_increase_aux_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg1 < 0 /\ arg1-arg1P2 == 0), cost: 1 New rule: f32_0_increase_GE -> f95_0_increase_aux_LE : arg2'=arg2P2, 10-arg1 > 0, cost: 1 Applied preprocessing Original rule: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=arg1P3, arg2'=arg2P3, (1 > 0 /\ 1+arg1-arg1P3 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f32_0_increase_GE -> f32_0_increase_GE : arg1'=1+arg1, arg2'=arg2P1, (1+arg1 > 0 /\ 10-arg1 > 0), cost: 1 7: f32_0_increase_GE -> f95_0_increase_aux_LE : arg2'=arg2P2, 10-arg1 > 0, cost: 1 8: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=1+arg1, arg2'=arg2P1, (1+arg1 > 0 /\ 10-arg1 > 0), cost: 1 New rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=arg1+n0, arg2'=arg2P1, (1+arg1 > 0 /\ -1+n0 >= 0 /\ 11-arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=arg1+n0, arg2'=arg2P1, (1+arg1 > 0 /\ -1+n0 >= 0 /\ 11-arg1-n0 > 0), cost: n0 New rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=10, arg2'=arg2P1, (1 > 0 /\ 9-arg1 >= 0 /\ 1+arg1 > 0), cost: 10-arg1 Applied simplification Original rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=10, arg2'=arg2P1, (1 > 0 /\ 9-arg1 >= 0 /\ 1+arg1 > 0), cost: 10-arg1 New rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=10, arg2'=arg2P1, (1+arg1 > 0 /\ -9+arg1 <= 0), cost: 10-arg1 Applied deletion Removed the following rules: 6 Applied nonterm Original rule: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 New rule: f95_0_increase_aux_LE -> [5] : -5+arg1 > 0, cost: NONTERM Applied acceleration Original rule: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 New rule: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=arg1+n3, arg2'=arg2P3, -5+arg1 > 0, cost: n3 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f32_0_increase_GE -> f95_0_increase_aux_LE : arg2'=arg2P2, 10-arg1 > 0, cost: 1 10: f32_0_increase_GE -> f32_0_increase_GE : arg1'=10, arg2'=arg2P1, (1+arg1 > 0 /\ -9+arg1 <= 0), cost: 10-arg1 11: f95_0_increase_aux_LE -> [5] : -5+arg1 > 0, cost: NONTERM 12: f95_0_increase_aux_LE -> f95_0_increase_aux_LE : arg1'=arg1+n3, arg2'=arg2P3, -5+arg1 > 0, cost: n3 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f32_0_increase_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f32_0_increase_GE -> f32_0_increase_GE : arg1'=10, arg2'=arg2P1, (1+arg1 > 0 /\ -9+arg1 <= 0), cost: 10-arg1 New rule: f1_0_main_Load -> f32_0_increase_GE : arg1'=10, arg2'=arg2P1, (arg1 > 0 /\ -9+arg2 <= 0 /\ 1+arg2 > 0), cost: 11-arg2 Applied deletion Removed the following rules: 10 popout

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

job log

popout

actions

all output return to ITS