WORST_CASE(INF,?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 && -1+arg2==arg2P_1 && arg2==arg3P_1 && arg2==arg4P_1 ], cost: 1
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 && -1+arg2==arg2P_2 && arg2==arg3P_2 && arg4==arg4P_2 ], cost: 1
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && -1+arg4==arg2P_3 && arg4==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 && -1+arg2==arg2P_4 && arg2==arg3P_4 && arg4==arg4P_4 ], cost: 1
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 && -1+arg4==arg1P_5 && arg4==arg2P_5 ], cost: 1
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 && 2==arg1P_6 ], cost: 1
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 && -1+arg1==arg1P_7 && arg1==arg2P_7 ], cost: 1
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
      8: f576_0_test_LT -> f576_0_test_LT : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 && -1+arg1==arg1P_9 ], cost: 1
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg2, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 ], cost: 1
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
      8: f576_0_test_LT -> f576_0_test_LT : arg1'=-1+arg1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 ], cost: 1
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 ], cost: 1

   Found no metering function for rule 1.
   Removing the simple loops:.

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg2, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 ], cost: 1

   Found no metering function for rule 3.
   Removing the simple loops:.

Accelerating simple loops of location 3.
   Accelerating the following rules:
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 ], cost: 1

   Found no metering function for rule 6.
   Removing the simple loops:.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f576_0_test_LT -> f576_0_test_LT : arg1'=-1+arg1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 ], cost: 1

   Accelerated rule 8 with metering function 1+arg1, yielding the new rule 11.
   Removing the simple loops: 8.

Accelerating simple loops of location 5.
   Accelerating the following rules:
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1

      During metering: Instantiating temporary variables by {arg1P_10==-1+arg1}
   Accelerated rule 9 with metering function arg1, yielding the new rule 12.
   Removing the simple loops: 9.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg2, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 ], cost: 1
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
     11: f576_0_test_LT -> f576_0_test_LT : arg1'=-1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 ], cost: 1+arg1
     12: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 ], cost: arg1
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
     13: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-2+arg2, arg3'=-1+arg2, arg4'=arg2, [ arg1>0 && arg2>0 && arg1P_2>0 && arg1P_2<=arg1 ], cost: 2
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
     14: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-2+arg4, arg3'=-1+arg4, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 ], cost: 2
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
     15: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-2+arg4, arg2'=-1+arg4, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>0 ], cost: 2
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
     16: f401_0_mk_LE -> f576_0_test_LT : arg1'=-1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2<1 ], cost: 4
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
     17: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>-1 && arg1<3 && arg1P_8>0 ], cost: 1+arg1P_8
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
     13: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-2+arg2, arg3'=-1+arg2, arg4'=arg2, [ arg1>0 && arg2>0 && arg1P_2>0 && arg1P_2<=arg1 ], cost: 2
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
     14: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-2+arg4, arg3'=-1+arg4, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 ], cost: 2
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
     15: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-2+arg4, arg2'=-1+arg4, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>0 ], cost: 2
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
     16: f401_0_mk_LE -> f576_0_test_LT : arg1'=-1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2<1 ], cost: 4
     17: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>-1 && arg1<3 && arg1P_8>0 ], cost: 1+arg1P_8
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     20: f162_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg4<1 ], cost: 2
     21: f162_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 && -1+arg4<1 ], cost: 3
     22: f162_0_mk_LE -> f401_0_mk_LE : arg1'=-2+arg4, arg2'=-1+arg4, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 && -1+arg4<1 ], cost: 4
     23: f401_0_mk_LE -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg2<1 && arg1P_8>0 ], cost: 2+arg1P_8
     18: __init -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2P_11, arg3'=arg2P_11, arg4'=arg2P_11, [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg1P_1>0 ], cost: 2
     19: __init -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-2+arg2P_11, arg3'=-1+arg2P_11, arg4'=arg2P_11, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 ], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     23: f401_0_mk_LE -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg2<1 && arg1P_8>0 ], cost: 2+arg1P_8
     24: __init -> f401_0_mk_LE : arg1'=-1+arg2P_11, arg2'=arg2P_11, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg1P_1>0 && arg2P_11<1 && arg1P_1>=arg1P_3 && arg1P_3>0 ], cost: 4
     25: __init -> f401_0_mk_LE : arg1'=-1+arg2P_11, arg2'=arg2P_11, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 ], cost: 6
     26: __init -> f401_0_mk_LE : arg1'=-2+arg2P_11, arg2'=-1+arg2P_11, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 ], cost: 7

Eliminated locations (on tree-shaped paths):
   Start location: __init
     27: __init -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg1P_1>0 && arg2P_11<1 && arg1P_1>=arg1P_3 && arg1P_3>0 && arg1P_8>0 ], cost: 6+arg1P_8
     28: __init -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 && arg1P_8>0 ], cost: 9+arg1P_8

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     27: __init -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg1P_1>0 && arg2P_11<1 && arg1P_1>=arg1P_3 && arg1P_3>0 && arg1P_8>0 ], cost: 6+arg1P_8
     28: __init -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 && arg1P_8>0 ], cost: 9+arg1P_8

Computing asymptotic complexity for rule 27
   Simplified the guard:
     27: __init -> f470_0_length_NONNULL : arg1'=0, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg2P_11<1 && arg1P_1>=arg1P_3 && arg1P_3>0 && arg1P_8>0 ], cost: 6+arg1P_8
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      1-arg2P_11 (+/+!), arg1P_11 (+/+!), arg1P_3 (+/+!), 1-arg1P_3+arg1P_1 (+/+!), arg1P_8 (+/+!), 1+arg1P_11-arg1P_1 (+/+!), 6+arg1P_8 (+), 1+arg2P_11 (+/+!) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {arg1P_11==1,arg2P_11==0,arg1P_3==1,arg1P_8==n,arg1P_1==1}
      resulting limit problem:
      [solved]

   Solution:
      arg1P_11 / 1
      arg2P_11 / 0
      arg1P_3 / 1
      arg1P_8 / n
      arg1P_1 / 1
   Resulting cost 6+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 6+n
   Rule cost:   6+arg1P_8
   Rule guard:  [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg2P_11<1 && arg1P_1>=arg1P_3 && arg1P_3>0 && arg1P_8>0 ]

WORST_CASE(INF,?)