Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f6 : A'=B, C'=D, [], cost: 1
      1: f6 -> f6 : A'=-1+A, C'=-1+C, [ 0>=1+A ], cost: 1
      2: f6 -> f6 : A'=-1+A, C'=-1+C, [ A>=1 ], cost: 1
      3: f6 -> f14 : A'=0, [ D>=1+B && A==0 ], cost: 1
      4: f6 -> f14 : A'=0, [ B>=1+D && A==0 ], cost: 1
      5: f6 -> f14 : A'=0, D'=B, [ A==0 && B==D ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f6 : A'=B, C'=D, [], cost: 1
      1: f6 -> f6 : A'=-1+A, C'=-1+C, [ 0>=1+A ], cost: 1
      2: f6 -> f6 : A'=-1+A, C'=-1+C, [ A>=1 ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f6 : A'=B, C'=D, [], cost: 1
      6: f6 -> [3] : [ 0>=1+A ], cost: INF
      7: f6 -> [3] : A'=0, C'=C-A, [ A>=1 ], cost: A


Applied chaining over branches and pruning:
  Start location: f0
      8: f0 -> [3] : A'=B, C'=D, [ 0>=1+B ], cost: INF
      9: f0 -> [3] : A'=0, C'=-B+D, [ B>=1 ], cost: 1+B


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      8: f0 -> [3] : A'=B, C'=D, [ 0>=1+B ], cost: INF
      9: f0 -> [3] : A'=0, C'=-B+D, [ B>=1 ], cost: 1+B


Computing complexity for remaining 2 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: 0>=1+B
  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,?)