Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f2
      1: f0 -> f0 : A'=-1+A, C'=A, [ 9>=A ], cost: 1
      0: f0 -> f3 : B'=free, [ A>=10 ], cost: 1
      2: f1 -> f0 : A'=-1, D'=-1, [ 9>=A ], cost: 1
      3: f2 -> f0 : A'=0, [], cost: 1


Simplified the transitions:
  Start location: f2
      1: f0 -> f0 : A'=-1+A, C'=A, [ 9>=A ], cost: 1
      3: f2 -> f0 : A'=0, [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f2
      4: f0 -> [4] : [ 9>=A ], cost: INF
      3: f2 -> f0 : A'=0, [], cost: 1


Applied simple chaining:
  Start location: f2
      3: f2 -> [4] : A'=0, [ 9>=0 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f2
      3: f2 -> [4] : A'=0, [ 9>=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: 9>=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,?)