Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f1
      0: f1 -> f0 : [], cost: 1
      1: f0 -> f0 : A'=B+A, [ A>=1 && B>=1 ], cost: 1
      2: f0 -> f0 : A'=B+A, [ A>=1 && 0>=1+B ], cost: 1

Eliminating 2 self-loops for location f0
  Self-Loop 1 has unbounded runtime, resulting in the new transition 3.
  Removing the self-loops: 1 2.
Adding an epsilon transition (to model nonexecution of the loops): 5.

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


Applied chaining over branches and pruning:
  Start location: f1
      6: f1 -> [2] : [ A>=1 && B>=1 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f1
      6: f1 -> [2] : [ A>=1 && B>=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: A>=1 && B>=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,?)