Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(2⋅X₀+X₁, X₂, X₂+1, X₃) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(2⋅X₀+X₁, X₂, X₂+1, X₃) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃

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

new bound:

54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82 {O(n)}

MPRF:

l1 [2-X₀-X₂ ; X₂+X₃+1-X₀-X₁ ; X₁+X₃ ]

All Bounds

Timebounds

Overall timebound:54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+83 {O(n)}
t₀: 1 {O(1)}
t₁: 54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82 {O(n)}

Costbounds

Overall costbound: 54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+83 {O(n)}
t₀: 1 {O(1)}
t₁: 54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82 {O(n)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₀, X₃: X₃ {O(n)}
t₁, X₀: 2916⋅2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅X₀⋅X₀+2916⋅2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅X₃⋅X₃+2970⋅2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅X₁⋅X₁+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅3024⋅X₂⋅X₂+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅5832⋅X₀⋅X₃+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅5886⋅X₀⋅X₁+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅5886⋅X₁⋅X₃+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅5940⋅X₀⋅X₂+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅5940⋅X₂⋅X₃+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅5994⋅X₁⋅X₂+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅6806+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅8910⋅X₃+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅8911⋅X₀+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅8993⋅X₁+2^(54⋅X₀+54⋅X₁+54⋅X₂+54⋅X₃+82)⋅9076⋅X₂ {O(EXP)}
t₁, X₁: 54⋅X₀+54⋅X₁+54⋅X₃+56⋅X₂+82 {O(n)}
t₁, X₂: 54⋅X₀+54⋅X₁+54⋅X₃+55⋅X₂+82 {O(n)}
t₁, X₃: X₃ {O(n)}