Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+1, X₂, X₂) :|: X₀+1 ≤ X₁
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+1, X₂, X₂) :|: X₀+1 ≤ X₁
new bound:
16⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
MPRF:
l1 [X₂-X₀-1 ; X₁-X₀ ]
Overall timebound:16⋅X₀+8⋅X₁+8⋅X₂+10 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
Overall costbound: 16⋅X₀+8⋅X₁+8⋅X₂+10 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 17⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
t₁, X₁: 2⋅X₂ {O(n)}
t₁, X₂: X₂ {O(n)}