Start: f300
Program_Vars: X₀, X₁
Temp_Vars: C, D
Locations: f1, f2, f300
Transitions:
t₀: f2(X₀, X₁) → f1(C, D) :|: X₀ ≤ 14 ∧ 1+C ≤ 0 ∧ 14 ≤ X₀
t₂: f2(X₀, X₁) → f1(X₀-1, C) :|: 15 ≤ X₀ ∧ X₀ ≤ 0
t₃: f2(X₀, X₁) → f1(X₀-1, C) :|: X₀ ≤ 13 ∧ X₀ ≤ 0
t₁: f2(X₀, X₁) → f2(C, X₁) :|: X₀ ≤ 14 ∧ 14 ≤ X₀ ∧ 0 ≤ C
t₄: f2(X₀, X₁) → f2(X₀-1, X₁) :|: 1 ≤ X₀ ∧ 15 ≤ X₀
t₅: f2(X₀, X₁) → f2(X₀-1, X₁) :|: X₀ ≤ 13 ∧ 1 ≤ X₀
t₆: f300(X₀, X₁) → f2(X₀, X₁)
Cut unsatisfiable transition [t₂: f2→f1]
Eliminate variables [D; X₁] that do not contribute to the problem
Found invariant 1+X₀ ≤ 0 for location f1
Start: f300
Program_Vars: X₀
Temp_Vars: C
Locations: f1, f2, f300
Transitions:
t₁₆: f2(X₀) → f1(C) :|: X₀ ≤ 14 ∧ 1+C ≤ 0 ∧ 14 ≤ X₀
t₁₇: f2(X₀) → f1(X₀-1) :|: X₀ ≤ 13 ∧ X₀ ≤ 0
t₁₈: f2(X₀) → f2(C) :|: X₀ ≤ 14 ∧ 14 ≤ X₀ ∧ 0 ≤ C
t₁₉: f2(X₀) → f2(X₀-1) :|: 1 ≤ X₀ ∧ 15 ≤ X₀
t₂₀: f2(X₀) → f2(X₀-1) :|: X₀ ≤ 13 ∧ 1 ≤ X₀
t₂₁: f300(X₀) → f2(X₀)
Found invariant 1+X₀ ≤ 0 for location f1
Found invariant 0 ≤ X₀ for location f2_v3
Found invariant X₀ ≤ 12 ∧ 0 ≤ X₀ for location f2_v1
Found invariant 14 ≤ X₀ for location f2_v2
Overall timebound:inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₂₁: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₂₁: 1 {O(1)}
t₂₀, X₀: 12 {O(1)}
t₂₁, X₀: X₀ {O(n)}