Initial Problem

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(2⋅X₀, X₂, X₂) :|: X₀ ≤ 1+X₁ ∧ 1 ≤ X₀

Preprocessing

Problem after Preprocessing

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(2⋅X₀, X₂, X₂) :|: X₀ ≤ 1+X₁ ∧ 1 ≤ X₀

MPRF for transition t₁: l1(X₀, X₁, X₂) → l1(2⋅X₀, X₂, X₂) :|: X₀ ≤ 1+X₁ ∧ 1 ≤ X₀ of depth 2:

new bound:

8⋅X₀+8⋅X₁+8⋅X₂+17 {O(n)}

• l1: [2+X₂-X₀; X₁]

All Bounds

Timebounds

Overall timebound:8⋅X₀+8⋅X₁+8⋅X₂+18 {O(n)}
t₀: 1 {O(1)}
t₁: 8⋅X₀+8⋅X₁+8⋅X₂+17 {O(n)}

Costbounds

Overall costbound: 8⋅X₀+8⋅X₁+8⋅X₂+18 {O(n)}
t₀: 1 {O(1)}
t₁: 8⋅X₀+8⋅X₁+8⋅X₂+17 {O(n)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 131072⋅2^(8⋅X₀)⋅2^(8⋅X₁)⋅2^(8⋅X₂)⋅X₀ {O(EXP)}
t₁, X₁: 2⋅X₂ {O(n)}
t₁, X₂: X₂ {O(n)}