Initial Problem

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

Preprocessing

Cut unsatisfiable transition t₀: l1→l1

Cut unsatisfiable transition t₁: l0→l1

Cut unreachable locations [l1] from the program graph

Eliminate variables {E,X₃} that do not contribute to the problem

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l2
Transitions:
t₇: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂
t₈: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁
t₉: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₁ ≤ X₀

All Bounds

Timebounds

Overall timebound:3 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}

Costbounds

Overall costbound: 3 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}

Sizebounds