Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f1
      0: f1 -> f2 : A'=free, B'=free, [], cost: 1
      1: f2 -> f2 : E'=free_1, [ D>=1+C ], cost: 1
      2: f2 -> f300 : F'=free_2, [ C>=D ], cost: 1


Simplified the transitions:
  Start location: f1
      0: f1 -> f2 : A'=free, B'=free, [], cost: 1
      1: f2 -> f2 : E'=free_1, [ D>=1+C ], cost: 1

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

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


Applied simple chaining:
  Start location: f1
      0: f1 -> [3] : A'=free, B'=free, [ D>=1+C ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f1
      0: f1 -> [3] : A'=free, B'=free, [ D>=1+C ], 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: D>=1+C
  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,?)