Start: f3
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: f1, f3, f300
Transitions:
t₁: f1(X₀, X₁) → f1(1+X₀, X₁) :|: 0 ≤ X₀
t₂: f1(X₀, X₁) → f300(X₀, C) :|: 1+X₀ ≤ 0
t₀: f3(X₀, X₁) → f1(X₀, X₁)
Eliminate variables [C; X₁] that do not contribute to the problem
Found invariant 1+X₀ ≤ 0 for location f300
Start: f3
Program_Vars: X₀
Temp_Vars:
Locations: f1, f3, f300
Transitions:
t₅: f1(X₀) → f1(1+X₀) :|: 0 ≤ X₀
t₆: f1(X₀) → f300(X₀) :|: 1+X₀ ≤ 0
t₇: f3(X₀) → f1(X₀)
Found invariant 1+X₀ ≤ 0 for location f300
Found invariant 1 ≤ X₀ for location f1_v1
Overall timebound:inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
Overall costbound: inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₆, X₀: X₀ {O(n)}
t₇, X₀: X₀ {O(n)}