Initial Problem

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

Preprocessing

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1

Problem after Preprocessing

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

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

new bound:

X₀ {O(n)}

MPRF:

l1 [X₀ ]

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

new bound:

X₁ {O(n)}

MPRF:

l1 [X₁ ]

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 2⋅X₀ {O(n)}
t₁, X₁: 2⋅X₁ {O(n)}
t₂, X₀: 2⋅X₀ {O(n)}
t₂, X₁: 2⋅X₁ {O(n)}