Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀ < 100
t₃: l1(X₀, X₁) → l4(X₀, X₁) :|: 100 ≤ X₀
t₁: l2(X₀, X₁) → l1(0, X₁)
t₄: l3(X₀, X₁) → l1(51, X₁) :|: X₀ < 50
t₅: l3(X₀, X₁) → l1(49, X₁) :|: 50 ≤ X₀
t₆: l4(X₀, X₁) → l5(X₀, X₁)
Cut unsatisfiable transition t₃: l1→l4
Cut unreachable locations [l4; l5] from the program graph
Eliminate variables {X₁} that do not contribute to the problem
Found invariant X₀ ≤ 51 ∧ 0 ≤ X₀ for location l1
Found invariant X₀ ≤ 51 ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₆: l0(X₀) → l2(X₀)
t₁₇: l1(X₀) → l3(X₀) :|: X₀ < 100 ∧ X₀ ≤ 51 ∧ 0 ≤ X₀
t₁₈: l2(X₀) → l1(0)
t₁₉: l3(X₀) → l1(51) :|: X₀ < 50 ∧ X₀ ≤ 51 ∧ 0 ≤ X₀
t₂₀: l3(X₀) → l1(49) :|: 50 ≤ X₀ ∧ X₀ ≤ 51 ∧ 0 ≤ X₀
Found invariant X₀ ≤ 51 ∧ 51 ≤ X₀ for location n_l1___4
Found invariant X₀ ≤ 51 ∧ 51 ≤ X₀ for location n_l3___3
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___5
Found invariant X₀ ≤ 49 ∧ 49 ≤ X₀ for location n_l1___2
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₀ ≤ 49 ∧ 49 ≤ X₀ for location n_l3___1
Found invariant X₀ ≤ 51 ∧ 51 ≤ X₀ for location n_l1___4
Found invariant X₀ ≤ 51 ∧ 51 ≤ X₀ for location n_l3___3
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___5
Found invariant X₀ ≤ 49 ∧ 49 ≤ X₀ for location n_l1___2
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₀ ≤ 49 ∧ 49 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
t₁₈: 1 {O(1)}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
t₁₈: 1 {O(1)}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₁₆, X₀: X₀ {O(n)}
t₁₇, X₀: 51 {O(1)}
t₁₈, X₀: 0 {O(1)}
t₁₉, X₀: 51 {O(1)}
t₂₀, X₀: 49 {O(1)}