Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f2 : A'=200+A, [ 99+A>=0 ], cost: 1
      1: f0 -> f2 : A'=500+A, [ A>=1 ], cost: 1
      2: f2 -> f2 : A'=700+A, [ 199+A>=0 ], cost: 1

Eliminating 1 self-loops for location f2
  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
      0: f0 -> f2 : A'=200+A, [ 99+A>=0 ], cost: 1
      1: f0 -> f2 : A'=500+A, [ A>=1 ], cost: 1
      3: f2 -> [2] : [ 199+A>=0 ], cost: INF


Applied chaining over branches and pruning:
  Start location: f0
      4: f0 -> [2] : A'=200+A, [ 99+A>=0 && 399+A>=0 ], cost: INF
      5: f0 -> [2] : A'=500+A, [ A>=1 && 699+A>=0 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      4: f0 -> [2] : A'=200+A, [ 99+A>=0 && 399+A>=0 ], cost: INF
      5: f0 -> [2] : A'=500+A, [ A>=1 && 699+A>=0 ], 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: 99+A>=0 && 399+A>=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,?)