Integer Transition Systems pair #487527779

details
property	value
status	complete
benchmark	AlternatingGrowReduce2.jar-obl-9.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.249925851822 seconds
cpu usage	0.250128955
max memory	1.3340672E7
stage attributes
key	value
output-size	8246
starexec-result	WORST_CASE(Omega(0),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f167_0_createList_Return -> f276_0_main_NULL : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1+arg2P0 <= 0 /\ -arg1P0 == 0 /\ arg2P0 > 0 /\ 2-arg1+arg2 <= 0), cost: 1
   2: f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P2, arg2'=arg2P2, (1-arg1P2 == 0 /\ 1-arg2+arg2P2 <= 0 /\ -arg1 == 0 /\ 1+arg2P2 > 0 /\ arg2 > 0), cost: 1
   3: f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P3, arg2'=arg2P3, (-1-arg2P3+arg2 >= 0 /\ 2-arg1 == 0 /\ arg2 > 0 /\ 1+arg2P3 > 0 /\ -arg1P3 == 0), cost: 1
   4: f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P4, arg2'=arg2P4, (1-arg1 == 0 /\ -2+arg2P4-arg2 <= 0 /\ arg2 > 0 /\ -2+arg2P4 > 0 /\ 2-arg1P4 == 0), cost: 1
   1: f1_0_main_Load -> f276_0_main_NULL : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ arg2P1 > 0 /\ -arg1P1 == 0 /\ arg2 > 0 /\ 1+x60 > 0), cost: 1
   5: f1_0_main_Load -> f190_0_createList_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ 1+arg1P5 > 0 /\ arg2 > 0), cost: 1
   6: f190_0_createList_LE -> f190_0_createList_LE : arg1'=arg1P6, arg2'=arg2P6, (arg1 > 0 /\ -1+arg1-arg1P6 == 0), cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Removed unreachable rules and leafs
Start location: __init
   2: f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P2, arg2'=arg2P2, (1-arg1P2 == 0 /\ 1-arg2+arg2P2 <= 0 /\ -arg1 == 0 /\ 1+arg2P2 > 0 /\ arg2 > 0), cost: 1
   3: f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P3, arg2'=arg2P3, (-1-arg2P3+arg2 >= 0 /\ 2-arg1 == 0 /\ arg2 > 0 /\ 1+arg2P3 > 0 /\ -arg1P3 == 0), cost: 1
   4: f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P4, arg2'=arg2P4, (1-arg1 == 0 /\ -2+arg2P4-arg2 <= 0 /\ arg2 > 0 /\ -2+arg2P4 > 0 /\ 2-arg1P4 == 0), cost: 1
   1: f1_0_main_Load -> f276_0_main_NULL : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ arg2P1 > 0 /\ -arg1P1 == 0 /\ arg2 > 0 /\ 1+x60 > 0), cost: 1
   5: f1_0_main_Load -> f190_0_createList_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ 1+arg1P5 > 0 /\ arg2 > 0), cost: 1
   6: f190_0_createList_LE -> f190_0_createList_LE : arg1'=arg1P6, arg2'=arg2P6, (arg1 > 0 /\ -1+arg1-arg1P6 == 0), cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_Load -> f276_0_main_NULL : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ arg2P1 > 0 /\ -arg1P1 == 0 /\ arg2 > 0 /\ 1+x60 > 0), cost: 1
New rule:
f1_0_main_Load -> f276_0_main_NULL : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ arg2P1 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P2, arg2'=arg2P2, (1-arg1P2 == 0 /\ 1-arg2+arg2P2 <= 0 /\ -arg1 == 0 /\ 1+arg2P2 > 0 /\ arg2 > 0), cost: 1
New rule:
f276_0_main_NULL -> f276_0_main_NULL : arg1'=1, arg2'=arg2P2, (arg1 == 0 /\ 1-arg2+arg2P2 <= 0 /\ 1+arg2P2 > 0), cost: 1

Applied preprocessing
Original rule:
f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P3, arg2'=arg2P3, (-1-arg2P3+arg2 >= 0 /\ 2-arg1 == 0 /\ arg2 > 0 /\ 1+arg2P3 > 0 /\ -arg1P3 == 0), cost: 1
New rule:
f276_0_main_NULL -> f276_0_main_NULL : arg1'=0, arg2'=arg2P3, (-1-arg2P3+arg2 >= 0 /\ 1+arg2P3 > 0 /\ -2+arg1 == 0), cost: 1

Applied preprocessing
Original rule:
f276_0_main_NULL -> f276_0_main_NULL : arg1'=arg1P4, arg2'=arg2P4, (1-arg1 == 0 /\ -2+arg2P4-arg2 <= 0 /\ arg2 > 0 /\ -2+arg2P4 > 0 /\ 2-arg1P4 == 0), cost: 1
New rule:
f276_0_main_NULL -> f276_0_main_NULL : arg1'=2, arg2'=arg2P4, (-1+arg1 == 0 /\ -2+arg2P4-arg2 <= 0 /\ -2+arg2P4 > 0), cost: 1

Applied preprocessing
Original rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=arg1P6, arg2'=arg2P6, (arg1 > 0 /\ -1+arg1-arg1P6 == 0), cost: 1
New rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P6, arg1 > 0, cost: 1

Simplified rules
Start location: __init
   9: f276_0_main_NULL -> f276_0_main_NULL : arg1'=1, arg2'=arg2P2, (arg1 == 0 /\ 1-arg2+arg2P2 <= 0 /\ 1+arg2P2 > 0), cost: 1
  10: f276_0_main_NULL -> f276_0_main_NULL : arg1'=0, arg2'=arg2P3, (-1-arg2P3+arg2 >= 0 /\ 1+arg2P3 > 0 /\ -2+arg1 == 0), cost: 1
  11: f276_0_main_NULL -> f276_0_main_NULL : arg1'=2, arg2'=arg2P4, (-1+arg1 == 0 /\ -2+arg2P4-arg2 <= 0 /\ -2+arg2P4 > 0), cost: 1
   5: f1_0_main_Load -> f190_0_createList_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ 1+arg1P5 > 0 /\ arg2 > 0), cost: 1
   8: f1_0_main_Load -> f276_0_main_NULL : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ arg2P1 > 0 /\ arg2 > 0), cost: 1
  12: f190_0_createList_LE -> f190_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P6, arg1 > 0, cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Applied acceleration
Original rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P6, arg1 > 0, cost: 1
New rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=arg1-n9, arg2'=arg2P6, (1+arg1-n9 > 0 /\ -1+n9 >= 0), cost: n9

Applied instantiation
Original rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=arg1-n9, arg2'=arg2P6, (1+arg1-n9 > 0 /\ -1+n9 >= 0), cost: n9
New rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=0, arg2'=arg2P6, (1 > 0 /\ -1+arg1 >= 0), cost: arg1

Applied simplification
Original rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=0, arg2'=arg2P6, (1 > 0 /\ -1+arg1 >= 0), cost: arg1
New rule:
f190_0_createList_LE -> f190_0_createList_LE : arg1'=0, arg2'=arg2P6, -1+arg1 >= 0, cost: arg1

Applied deletion
Removed the following rules: 12

Accelerated simple loops
Start location: __init
   9: f276_0_main_NULL -> f276_0_main_NULL : arg1'=1, arg2'=arg2P2, (arg1 == 0 /\ 1-arg2+arg2P2 <= 0 /\ 1+arg2P2 > 0), cost: 1
  10: f276_0_main_NULL -> f276_0_main_NULL : arg1'=0, arg2'=arg2P3, (-1-arg2P3+arg2 >= 0 /\ 1+arg2P3 > 0 /\ -2+arg1 == 0), cost: 1
  11: f276_0_main_NULL -> f276_0_main_NULL : arg1'=2, arg2'=arg2P4, (-1+arg1 == 0 /\ -2+arg2P4-arg2 <= 0 /\ -2+arg2P4 > 0), cost: 1
   5: f1_0_main_Load -> f190_0_createList_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ 1+arg1P5 > 0 /\ arg2 > 0), cost: 1
   8: f1_0_main_Load -> f276_0_main_NULL : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ arg2P1 > 0 /\ arg2 > 0), cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions all output return to Integer Transition Systems