Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, X₃, X₄, X₅)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀-1, X₁-1, X₀, X₁, X₀-2, X₅) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, G, X₂, X₃, X₄, H) :|: X₁ ≤ 0 ∧ G ≤ 0
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, H) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
Eliminate variables {H,X₂,X₃,X₄,X₅} that do not contribute to the problem
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: G
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀, X₁) → l1(X₀, X₁)
t₉: l1(X₀, X₁) → l1(X₀-1, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₁₀: l1(X₀, X₁) → l2(X₀, G) :|: X₁ ≤ 0 ∧ G ≤ 0
t₁₁: l1(X₀, X₁) → l2(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
new bound:
X₁ {O(n)}
Overall timebound:X₁+3 {O(n)}
t₈: 1 {O(1)}
t₉: X₁ {O(n)}
t₁₀: 1 {O(1)}
t₁₁: 1 {O(1)}
Overall costbound: X₁+3 {O(n)}
t₈: 1 {O(1)}
t₉: X₁ {O(n)}
t₁₀: 1 {O(1)}
t₁₁: 1 {O(1)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₁₀, X₀: 2⋅X₀ {O(n)}
t₁₁, X₀: 2⋅X₀ {O(n)}
t₁₁, X₁: 2⋅X₁ {O(n)}