Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀-2⋅X₁, X₁+1) :|: 1 ≤ X₀
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀-2⋅X₁, X₁+1) :|: 1 ≤ X₀
new bound:
16⋅X₁+8⋅X₀+9 {O(n)}
Overall timebound:16⋅X₁+8⋅X₀+10 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₁+8⋅X₀+9 {O(n)}
Overall costbound: 16⋅X₁+8⋅X₀+10 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₁+8⋅X₀+9 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 153⋅2^(16⋅X₁+8⋅X₀+9)⋅X₀+272⋅2^(16⋅X₁+8⋅X₀+9)⋅X₀⋅X₁+288⋅2^(16⋅X₁+8⋅X₀+9)⋅X₁⋅X₁+2^(16⋅X₁+8⋅X₀+9)⋅324⋅X₁+2^(16⋅X₁+8⋅X₀+9)⋅64⋅X₀⋅X₀+2^(16⋅X₁+8⋅X₀+9)⋅90 {O(EXP)}
t₁, X₁: 17⋅X₁+8⋅X₀+9 {O(n)}