details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	136.365 seconds
cpu usage	136.339
user time	135.518
system time	0.821308
max virtual memory	882576.0
max residence set size	651976.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 3: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P3, arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0 /\ arg1-arg1P3 == 0), cost: 1 2: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-5+arg1-5*x70 < 0 /\ arg1-arg1P2 == 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 4: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -5+arg1-5*x110 < 0 /\ -1+arg1-arg1P4 == 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 -> f49_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1 Applied preprocessing Original rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-5+arg1-5*x70 < 0 /\ arg1-arg1P2 == 0 /\ arg1-5*x70 >= 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 Applied preprocessing Original rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P3, arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0 /\ arg1-arg1P3 == 0), cost: 1 New rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1 Applied preprocessing Original rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -5+arg1-5*x110 < 0 /\ -1+arg1-arg1P4 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1 Simplified rules Start location: __init 6: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1 9: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1 8: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 10: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Second rule: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: __init 7: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1 9: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1 8: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 10: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1 11: __init -> f49_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2 Eliminating location f49_0_loop_LE\' by chaining: Applied chaining First rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P1, (arg1-5*x50 == 0 /\ -2+arg1 > 0), cost: 1 Second rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x50 == 0 /\ arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 2 Applied chaining First rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1 Second rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0), cost: 1 New rule: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P2, (arg1-5*x70 == 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 2 Applied chaining First rule: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P3, (-2+arg1 > 0 /\ arg1-5*x90 > 0), cost: 1 Second rule: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ 5-arg1+5*x110 > 0), cost: 1 New rule: f49_0_loop_LE -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P4, (arg1-5*x110 > 0 /\ -2+arg1 > 0 /\ arg1-5*x90 > 0 /\ 5-arg1+5*x110 > 0), cost: 2 popout

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

job log

popout

actions

all output return to ITS