Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, 3⋅X₁+2⋅X₂, -5⋅X₁-3⋅X₂, (X₀)²+X₃) :|: 0 < X₀
t₂: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₃: l2(X₀, X₁, X₂, X₃) → l2(X₀, X₁-1, X₂-1, X₃) :|: 0 < X₁+X₂
Eliminate variables {X₃} that do not contribute to the problem
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₉: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁₀: l1(X₀, X₁, X₂) → l1(X₀-1, 3⋅X₁+2⋅X₂, -5⋅X₁-3⋅X₂) :|: 0 < X₀
t₁₁: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₁₂: l2(X₀, X₁, X₂) → l2(X₀, X₁-1, X₂-1) :|: 0 < X₁+X₂
new bound:
X₀ {O(n)}
new bound:
10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+X₁+X₂ {O(EXP)}
new bound:
10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+X₁+X₂ {O(EXP)}
Overall timebound:10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+X₀+X₁+X₂+2 {O(EXP)}
t₉: 1 {O(1)}
t₁₀: X₀ {O(n)}
t₁₁: 1 {O(1)}
t₁₂: 10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+X₁+X₂ {O(EXP)}
Overall costbound: 10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+X₀+X₁+X₂+2 {O(EXP)}
t₉: 1 {O(1)}
t₁₀: X₀ {O(n)}
t₁₁: 1 {O(1)}
t₁₂: 10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+X₁+X₂ {O(EXP)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₉, X₂: X₂ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₀, X₁: 10^(X₀)⋅X₁+10^(X₀)⋅X₂ {O(EXP)}
t₁₀, X₂: 10^(X₀)⋅X₁+10^(X₀)⋅X₂ {O(EXP)}
t₁₁, X₀: 2⋅X₀ {O(n)}
t₁₁, X₁: 10^(X₀)⋅X₁+10^(X₀)⋅X₂+X₁ {O(EXP)}
t₁₁, X₂: 10^(X₀)⋅X₁+10^(X₀)⋅X₂+X₂ {O(EXP)}
t₁₂, X₀: 2⋅X₀ {O(n)}
t₁₂, X₁: 10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+10^(X₀)⋅X₁+10^(X₀)⋅X₂+2⋅X₁+X₂ {O(EXP)}
t₁₂, X₂: 10^(X₀)⋅2⋅X₁+10^(X₀)⋅2⋅X₂+10^(X₀)⋅X₁+10^(X₀)⋅X₂+2⋅X₂+X₁ {O(EXP)}