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₁, 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₁, X₁-1) :|: 1 ≤ X₀
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₁: X₁ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 2⋅X₁+4 {O(n)}
Overall timebound:2⋅X₁+5 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₁+4 {O(n)}
Overall costbound: 2⋅X₁+5 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₁+4 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 4⋅X₁+4 {O(n)}
t₁, X₁: 3⋅X₁+4 {O(n)}