details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.610991001129 seconds
cpu usage	0.608051219
max memory	1.3381632E7

stage attributes

key	value
output-size	9187
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f74_0_main_LE -> f74_0_main_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0 /\ arg1-arg1P1 == 0), cost: 1 2: f74_0_main_LE\' -> f74_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -2+arg1-2*x70 < 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x70 == 0 /\ -1+arg1-arg1P2 == 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f74_0_main_LE -> f74_0_main_LE\' : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f74_0_main_LE -> f74_0_main_LE\' : arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0), cost: 1 Applied preprocessing Original rule: f74_0_main_LE\' -> f74_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -2+arg1-2*x70 < 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x70 == 0 /\ -1+arg1-arg1P2 == 0), cost: 1 New rule: f74_0_main_LE\' -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 4: f74_0_main_LE -> f74_0_main_LE\' : arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0), cost: 1 5: f74_0_main_LE\' -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Second rule: f1_0_main_Load -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2 Applied deletion Removed the following rules: 0 3 Eliminating location f74_0_main_LE\' by chaining: Applied chaining First rule: f74_0_main_LE -> f74_0_main_LE\' : arg2'=arg2P1, (arg1 > 0 /\ arg1-2*x50 == 0), cost: 1 Second rule: f74_0_main_LE\' -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1 New rule: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0 /\ arg1-2*x50 == 0), cost: 2 Applied deletion Removed the following rules: 4 5 Eliminated locations on linear paths Start location: __init 7: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0 /\ arg1-2*x50 == 0), cost: 2 6: __init -> f74_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0 /\ 1+arg1P0 > 0), cost: 2 Applied acceleration Original rule: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ arg1-2*x70 == 0 /\ arg1-2*x50 == 0), cost: 2 New rule: f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0 Applied instantiation Original rule: f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0 New rule: f74_0_main_LE -> f74_0_main_LE : arg1'=0, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -1+arg1 >= 0 /\ arg1-2*x50 >= 0 /\ 1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 1-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 1 > 0)), cost: 2*arg1 Applied instantiation Original rule: f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0 New rule: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x70, arg2'=arg2P2, (0 >= 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ 2*x70-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 2*x70 > 0)), cost: 2+2*arg1-4*x70 Applied instantiation Original rule: f74_0_main_LE -> f74_0_main_LE : arg1'=arg1-n0, arg2'=arg2P2, (1+arg1-n0-2*x70 >= 0 /\ -1+n0 >= 0 /\ arg1-2*x70 >= 0 /\ 1+arg1-n0-2*x50 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1+arg1-n0 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*n0 New rule: f74_0_main_LE -> f74_0_main_LE : arg1'=-1+2*x50, arg2'=arg2P2, (0 >= 0 /\ -2*x70+2*x50 >= 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x50 >= 0 /\ -arg1+2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 2*x50 > 0)), cost: 2+2*arg1-4*x50 Applied simplification Original rule: f74_0_main_LE -> f74_0_main_LE : arg1'=0, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -1+arg1 >= 0 /\ arg1-2*x50 >= 0 /\ 1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 1-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ ((arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0) \/ 1 > 0)), cost: 2*arg1 New rule: f74_0_main_LE -> f74_0_main_LE : arg1'=0, arg2'=arg2P2, (arg1-2*x70 >= 0 /\ -1+arg1 >= 0 /\ arg1-2*x50 >= 0 /\ 1-2*x70 >= 0 /\ -arg1+2*x50 >= 0 /\ 1-2*x50 >= 0 /\ -arg1+2*x70 >= 0 /\ (1 > 0 \/ (arg1 > 0 /\ arg1-2*x70 >= 0 /\ -arg1+2*x70 >= 0))), cost: 2*arg1 Applied simplification Original rule: popout

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

job log

popout

actions

all output return to Integer Transition Systems