Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      2: f4 -> f4 : A'=free_1, B'=1+free_1, C'=B, [], cost: 1
      0: f4 -> f5 : [ A>=1+B ], cost: 1
      1: f0 -> f4 : A'=free, B'=1+free, C'=B, [], cost: 1


Simplified the transitions:
  Start location: f0
      2: f4 -> f4 : A'=free_1, B'=1+free_1, C'=B, [], cost: 1
      1: f0 -> f4 : A'=free, B'=1+free, C'=B, [], cost: 1

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

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


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


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