Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f30
      0: f4 -> f5 : B'=1, [ A>=2 ], cost: 1
      1: f4 -> f5 : B'=0, [ 1>=A ], cost: 1
      3: f5 -> f4 : A'=-1+A, D'=free_1, [ 0>=free_1 && free_1>=1 ], cost: 1
      4: f5 -> f4 : A'=1+A, D'=free_2, [ free_2>=1 ], cost: 1
      5: f5 -> f3 : E'=0, [ 0>=B ], cost: 1
      2: f30 -> f4 : A'=2, C'=2, D'=free, [], cost: 1


Simplified the transitions:
  Start location: f30
      0: f4 -> f5 : B'=1, [ A>=2 ], cost: 1
      1: f4 -> f5 : B'=0, [ 1>=A ], cost: 1
      3: f5 -> f4 : A'=-1+A, D'=free_1, [ 0>=free_1 && free_1>=1 ], cost: 1
      4: f5 -> f4 : A'=1+A, D'=free_2, [ free_2>=1 ], cost: 1
      2: f30 -> f4 : A'=2, C'=2, D'=free, [], cost: 1


Applied chaining over branches and pruning:
  Start location: f30
      6: f4 -> f4 : A'=1+A, B'=1, D'=free_2, [ A>=2 && free_2>=1 ], cost: 2
      7: f4 -> f4 : A'=1+A, B'=0, D'=free_2, [ 1>=A && free_2>=1 ], cost: 2
      2: f30 -> f4 : A'=2, C'=2, D'=free, [], cost: 1

Eliminating 2 self-loops for location f4
  Self-Loop 6 has unbounded runtime, resulting in the new transition 8.
  Self-Loop 7 has the metering function: 2-A, resulting in the new transition 9.
  Removing the self-loops: 6 7.

Removed all Self-loops using metering functions (where possible):
  Start location: f30
      8: f4 -> [4] : [ A>=2 && free_2>=1 ], cost: INF
      9: f4 -> [4] : A'=2, B'=0, D'=free_2, [ 1>=A && free_2>=1 ], cost: 4-2*A
      2: f30 -> f4 : A'=2, C'=2, D'=free, [], cost: 1


Applied chaining over branches and pruning:
  Start location: f30
     10: f30 -> [4] : A'=2, C'=2, D'=free, [ 2>=2 && free_2>=1 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f30
     10: f30 -> [4] : A'=2, C'=2, D'=free, [ 2>=2 && free_2>=1 ], 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: 2>=2 && free_2>=1
  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,?)