Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f2
      0: f2 -> f1 : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [], cost: 1
      1: f1 -> f1 : K'=free_2, L'=free_5, M'=free_1, N'=free_3, O'=free_4, P'=free_6, [ 0>=free_7 && 0>=1+J ], cost: 1
      2: f1 -> f1 : K'=free_9, L'=free_13, M'=free_8, N'=free_10, Q_1'=free_12, R'=free_14, S'=free_11, [ 0>=1+J && free_15>=1 && free_16>=2 ], cost: 1
      3: f1 -> f1 : K'=free_18, N'=free_22, O'=free_17, P'=free_19, T'=free_21, U'=free_23, V'=free_20, [ 0>=2+free_24 && J>=1 ], cost: 1
      4: f1 -> f1 : K'=free_26, N'=free_31, Q_1'=free_25, R'=free_28, S'=free_30, T'=free_32, U'=free_29, V'=free_27, [ J>=1 && free_33>=0 && 1+free_34>=0 ], cost: 1
      5: f1 -> f300 : K'=free_36, L'=free_39, M'=free_35, N'=free_37, Q_1'=free_38, W'=free_40, [ 1>=free_42 && 0>=1+J && free_41>=1 ], cost: 1
      6: f1 -> f300 : K'=free_44, N'=free_48, Q_1'=free_43, T'=free_45, U'=free_47, V'=free_49, W'=free_46, [ 0>=1+free_50 && J>=1 && 1+free_51>=0 ], cost: 1
      7: f1 -> f300 : K'=free_53, T'=free_54, W'=free_52, [ J==0 ], cost: 1


Simplified the transitions:
  Start location: f2
      0: f2 -> f1 : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [], cost: 1
      1: f1 -> f1 : K'=free_2, L'=free_5, M'=free_1, N'=free_3, O'=free_4, P'=free_6, [ 0>=1+J ], cost: 1
      2: f1 -> f1 : K'=free_9, L'=free_13, M'=free_8, N'=free_10, Q_1'=free_12, R'=free_14, S'=free_11, [ 0>=1+J ], cost: 1
      3: f1 -> f1 : K'=free_18, N'=free_22, O'=free_17, P'=free_19, T'=free_21, U'=free_23, V'=free_20, [ J>=1 ], cost: 1
      4: f1 -> f1 : K'=free_26, N'=free_31, Q_1'=free_25, R'=free_28, S'=free_30, T'=free_32, U'=free_29, V'=free_27, [ J>=1 ], cost: 1

Eliminating 4 self-loops for location f1
  Self-Loop 1 has unbounded runtime, resulting in the new transition 8.
  Self-Loop 2 has unbounded runtime, resulting in the new transition 9.
  Self-Loop 3 has unbounded runtime, resulting in the new transition 10.
  Self-Loop 4 has unbounded runtime, resulting in the new transition 11.
  Removing the self-loops: 1 2 3 4.
Removing duplicate transition: 8.
Removing duplicate transition: 10.

Removed all Self-loops using metering functions (where possible):
  Start location: f2
      0: f2 -> f1 : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [], cost: 1
      9: f1 -> [3] : [ 0>=1+J ], cost: INF
     11: f1 -> [3] : [ J>=1 ], cost: INF


Applied chaining over branches and pruning:
  Start location: f2
     12: f2 -> [3] : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [ 0>=1+J ], cost: INF
     13: f2 -> [3] : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [ J>=1 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f2
     12: f2 -> [3] : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [ 0>=1+J ], cost: INF
     13: f2 -> [3] : A'=free, B'=free, C'=free, D'=free, E'=free, F'=free, G'=free, H'=free, Q'=free, [ J>=1 ], cost: INF


Computing complexity for remaining 2 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: 0>=1+J
  Final Cost:  INF

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: INF
  Complexity value: INF

WORST_CASE(INF,?)