Start: f0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: f0, f12, f2, f20, f26, f28, f30, f9
Transitions:
t₁₁: f0(X₀, X₁) → f9(C, X₁)
t₄: f12(X₀, X₁) → f9(1+X₀, X₁) :|: 6 ≤ X₀
t₈: f12(X₀, X₁) → f9(1+X₀, X₁) :|: X₀ ≤ 5
t₁: f2(X₀, X₁) → f2(X₀, X₁)
t₆: f20(X₀, X₁) → f20(X₀-1, X₁) :|: 3 ≤ X₀
t₇: f20(X₀, X₁) → f9(X₀, X₁) :|: X₀ ≤ 2
t₀: f26(X₀, X₁) → f2(X₀, X₁)
t₅: f28(X₀, X₁) → f30(X₀, X₁)
t₂: f9(X₀, X₁) → f12(X₀, C) :|: X₀ ≤ 5 ∧ 1+C ≤ 0
t₃: f9(X₀, X₁) → f12(X₀, C) :|: X₀ ≤ 5 ∧ 1 ≤ C
t₉: f9(X₀, X₁) → f20(X₀, 0) :|: X₀ ≤ 5
t₁₀: f9(X₀, X₁) → f20(X₀, X₁) :|: 6 ≤ X₀
Cut unreachable locations [f2; f26; f28; f30] from the program graph
Cut unsatisfiable transition [t₄: f12→f9]
Eliminate variables [X₁] that do not contribute to the problem
Found invariant X₀ ≤ 5 for location f12
Start: f0
Program_Vars: X₀
Temp_Vars: C
Locations: f0, f12, f20, f9
Transitions:
t₂₃: f0(X₀) → f9(C)
t₂₄: f12(X₀) → f9(1+X₀) :|: X₀ ≤ 5
t₂₅: f20(X₀) → f20(X₀-1) :|: 3 ≤ X₀
t₂₆: f20(X₀) → f9(X₀) :|: X₀ ≤ 2
t₂₇: f9(X₀) → f12(X₀) :|: X₀ ≤ 5 ∧ 1+C ≤ 0
t₂₈: f9(X₀) → f12(X₀) :|: X₀ ≤ 5 ∧ 1 ≤ C
t₂₉: f9(X₀) → f20(X₀) :|: X₀ ≤ 5
t₃₀: f9(X₀) → f20(X₀) :|: 6 ≤ X₀
Found invariant 5 ≤ X₀ for location f20_v5
Found invariant X₀ ≤ 2 for location f20_v4
Found invariant X₀ ≤ 3 for location f9_v3
Found invariant 6 ≤ X₀ for location f20_v1
Found invariant X₀ ≤ 6 for location f9_v1
Found invariant 2 ≤ X₀ for location f20_v6
Found invariant X₀ ≤ 2 for location f12_v2
Found invariant X₀ ≤ 2 for location f9_v2
Found invariant X₀ ≤ 4 ∧ 2 ≤ X₀ for location f20_v3
Found invariant X₀ ≤ 5 for location f12_v1
Found invariant X₀ ≤ 5 for location f20_v2
Overall timebound:inf {Infinity}
t₂₃: 1 {O(1)}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
t₂₈: inf {Infinity}
t₂₉: inf {Infinity}
t₃₀: inf {Infinity}
Overall costbound: inf {Infinity}
t₂₃: 1 {O(1)}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
t₂₈: inf {Infinity}
t₂₉: inf {Infinity}
t₃₀: inf {Infinity}