Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: F, G
Locations: l0, l1, l2, l3
Transitions:
t₄: l0(X₀, X₁, X₂, X₃, X₄) → l1(0, X₁, X₂, F, G)
t₀: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀+1, X₁, X₂, X₃, X₄) :|: X₀ ≤ 9
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l2(X₀, 0, F, X₃, X₄) :|: 10 ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁+1, X₂, X₃, X₄) :|: X₁ ≤ 9
t₂: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 10 ≤ X₁
Eliminate variables {F,G,X₂,X₃,X₄} that do not contribute to the problem
Found invariant X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 20 ∧ 0 ≤ X₁ ∧ 10 ≤ X₀+X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 10 ∧ 10 ≤ X₀ for location l2
Found invariant X₀ ≤ 10 ∧ 0 ≤ X₀ for location l1
Found invariant X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 20 ∧ 10 ≤ X₁ ∧ 20 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 10 ∧ 10 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₂: l0(X₀, X₁) → l1(0, X₁)
t₁₃: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₀ ≤ 9 ∧ X₀ ≤ 10 ∧ 0 ≤ X₀
t₁₄: l1(X₀, X₁) → l2(X₀, 0) :|: 10 ≤ X₀ ∧ X₀ ≤ 10 ∧ 0 ≤ X₀
t₁₅: l2(X₀, X₁) → l2(X₀, X₁+1) :|: X₁ ≤ 9 ∧ X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 20 ∧ 0 ≤ X₁ ∧ 10 ≤ X₀+X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 10 ∧ 10 ≤ X₀
t₁₆: l2(X₀, X₁) → l3(X₀, X₁) :|: 10 ≤ X₁ ∧ X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 20 ∧ 0 ≤ X₁ ∧ 10 ≤ X₀+X₁ ∧ X₀ ≤ 10+X₁ ∧ X₀ ≤ 10 ∧ 10 ≤ X₀
new bound:
10 {O(1)}
MPRF:
l1 [10-X₀ ]
new bound:
11 {O(1)}
MPRF:
l2 [11-X₁ ]
Overall timebound:24 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: 10 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 11 {O(1)}
t₁₆: 1 {O(1)}
Overall costbound: 24 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: 10 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 11 {O(1)}
t₁₆: 1 {O(1)}
t₁₂, X₀: 0 {O(1)}
t₁₂, X₁: X₁ {O(n)}
t₁₃, X₀: 10 {O(1)}
t₁₃, X₁: X₁ {O(n)}
t₁₄, X₀: 10 {O(1)}
t₁₄, X₁: 0 {O(1)}
t₁₅, X₀: 10 {O(1)}
t₁₅, X₁: 10 {O(1)}
t₁₆, X₀: 10 {O(1)}
t₁₆, X₁: 10 {O(1)}