Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f2
      0: f1 -> f1 : C'=free, D'=free_1, E'=free_2, [ B>=1+A ], cost: 1
      1: f1 -> f300 : C'=free_3, D'=free_4, F'=free_5, [ A>=B ], cost: 1
      2: f2 -> f1 : G'=free_6, H'=free_8, Q'=free_9, J'=free_7, [], cost: 1


Simplified the transitions:
  Start location: f2
      0: f1 -> f1 : C'=free, D'=free_1, E'=free_2, [ B>=1+A ], cost: 1
      2: f2 -> f1 : G'=free_6, H'=free_8, Q'=free_9, J'=free_7, [], cost: 1

Eliminating 1 self-loops for location f1
  Self-Loop 0 has unbounded runtime, resulting in the new transition 3.
  Removing the self-loops: 0.

Removed all Self-loops using metering functions (where possible):
  Start location: f2
      3: f1 -> [3] : [ B>=1+A ], cost: INF
      2: f2 -> f1 : G'=free_6, H'=free_8, Q'=free_9, J'=free_7, [], cost: 1


Applied simple chaining:
  Start location: f2
      2: f2 -> [3] : G'=free_6, H'=free_8, Q'=free_9, J'=free_7, [ B>=1+A ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f2
      2: f2 -> [3] : G'=free_6, H'=free_8, Q'=free_9, J'=free_7, [ B>=1+A ], cost: INF


Computing complexity for remaining 1 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: B>=1+A
  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,?)