Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f6
      0: f11 -> f15 : E'=2+C, F'=free, G'=free_1, H'=B, [ A>=2 && B>=A && B>=0 && free_2>=1 && C>=1 && D>=0 && E==1+C ], cost: 1
      1: f11 -> f14 : D'=-1+free_3, F'=0, G'=free_4, Q'=free_3, J'=-1, [ A>=2 && B>=A && Q>=A && B>=0 && free_3>=1 && E>=1 && F==0 ], cost: 1
      8: f11 -> f7 : D1'=free_22, [ B>=A && B>=0 && 0>=E && A>=2 ], cost: 1
      5: f15 -> f15 : D'=free_16, E'=2+T, F'=free_15, G'=free_14, U'=free_16, [ A>=2 && T>=1 && free_17>=1 && free_16>=0 && D>=0 && E==1+T ], cost: 1
      6: f15 -> f14 : D'=free_18, F'=0, G'=free_19, V'=Q_1, W'=free_18, [ A>=2 && E>=1 && free_18>=0 && D>=0 && F==0 && Q_1==V ], cost: 1
     12: f15 -> f7 : D1'=free_27, [ D>=0 && 0>=E && A>=2 ], cost: 1
      3: f14 -> f15 : D'=free_11, E'=2+N, F'=free_10, G'=free_9, N'=free_8, O'=1+N, P'=free_11, [ A>=2 && E>=1 && N>=1 && free_11>=0 && D>=0 && F==0 ], cost: 1
      4: f14 -> f14 : D'=free_12, F'=0, G'=free_13, R'=Q_1, S'=free_12, [ A>=2 && E>=1 && free_12>=0 && D>=0 && F==0 && Q_1==R ], cost: 1
     11: f14 -> f7 : D'=0, F'=0, Q_1'=0, D1'=free_26, [ E>=1 && A>=2 && Q_1==0 && F==0 && D==0 ], cost: 1
      2: f13 -> f13 : A'=1, E'=2+K, F'=free_5, G'=free_6, L'=M, [ free_7>=1 && K>=1 && E==1+K && A==1 ], cost: 1
      9: f13 -> f7 : A'=1, F'=0, G'=free_24, Q_1'=0, D1'=free_23, [ E>=1 && Q_1==0 && A==1 && F==0 ], cost: 1
     10: f13 -> f7 : A'=1, D1'=free_25, [ 0>=E && A==1 ], cost: 1
     14: f17 -> f15 : B'=free_39, E'=102, F'=free_45, G'=free_38, Q_1'=Z, X'=free_41, Z'=free_44, A1'=free_43, B1'=free_46, C1'=free_40, D1'=free_42, E1'=free_47, F1'=101, G1'=free_39, H1'=B, [ D>=0 && B>=X && B>=0 && free_39>=X && free_39>=0 && X>=2 && E==100 && A==X && Z==A1 && B1==A1 ], cost: 1
     15: f17 -> f14 : B'=free_55, E'=100, F'=0, G'=free_49, Q_1'=J1, X'=free_48, Z'=free_51, A1'=free_50, B1'=free_54, C1'=free_56, D1'=free_52, E1'=free_53, H1'=B, [ D>=0 && B>=X && B>=0 && free_55>=X && free_55>=0 && X>=2 && Q1>=X && E==100 && F==0 && A==X && J1==A1 && Z==A1 && B1==A1 ], cost: 1
      7: f17 -> f17 : B'=1+B, X'=A, Y'=-1+B, Z'=C1, A1'=Z, B1'=C1, C1'=free_20, [ X>=B && X>=1+free_21 && free_21>=0 && X>=2 && 1+Y==B && A==X && Z==A1 && B1==A1 ], cost: 1
     13: f6 -> f7 : A'=free_35, B'=free_29, E'=100, G'=free_28, Q_1'=0, X'=free_31, Z'=free_34, A1'=free_33, B1'=free_36, C1'=free_30, D1'=free_32, E1'=free_37, [ 0>=free_35 && Q_1==0 && E==100 && B==0 && A==X && Z==0 ], cost: 1


Simplified the transitions:
  Start location: f6
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f6
    <empty>


Computing complexity for remaining 0 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)