Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(0, C)
t₁: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₀ ≤ 49
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: 50 ≤ X₀
Eliminate variables {C,X₁} that do not contribute to the problem
Found invariant X₀ ≤ 50 ∧ 50 ≤ X₀ for location l2
Found invariant X₀ ≤ 50 ∧ 0 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₆: l0(X₀) → l1(0)
t₇: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 49 ∧ X₀ ≤ 50 ∧ 0 ≤ X₀
t₈: l1(X₀) → l2(X₀) :|: 50 ≤ X₀ ∧ X₀ ≤ 50 ∧ 0 ≤ X₀
new bound:
50 {O(1)}
Overall timebound:52 {O(1)}
t₆: 1 {O(1)}
t₇: 50 {O(1)}
t₈: 1 {O(1)}
Overall costbound: 52 {O(1)}
t₆: 1 {O(1)}
t₇: 50 {O(1)}
t₈: 1 {O(1)}
t₆, X₀: 0 {O(1)}
t₇, X₀: 50 {O(1)}
t₈, X₀: 50 {O(1)}