Trying to load file: main.koat

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

Eliminating 1 self-loops for location f1
  Self-Loop 1 has the metering function: B, resulting in the new transition 4.
  Removing the self-loops: 1.
Eliminating 1 self-loops for location f4
  Self-Loop 3 has unbounded runtime, resulting in the new transition 5.
  Removing the self-loops: 3.

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


Applied simple chaining:
  Start location: f0
      0: f0 -> [4] : A'=0, B'=0, C'=free_1, [ B>=1 && 0>=0 ], cost: INF


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