Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₄: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀ < 0
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: 0 ≤ X₀
t₆: l2(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₁: l3(X₀, X₁, X₂) → l1(X₁, X₁, X₂) :|: X₁ < X₂
t₂: l3(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ X₁
t₅: l4(X₀, X₁, X₂) → l1(X₀-X₂, X₁, X₂)

Preprocessing

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

Found invariant 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l4

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₄: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀ < 0 ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀ ≤ X₁
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: 0 ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀ ≤ X₁
t₆: l2(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₁: l3(X₀, X₁, X₂) → l1(X₁, X₁, X₂) :|: X₁ < X₂
t₂: l3(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂ ≤ X₁
t₅: l4(X₀, X₁, X₂) → l1(X₀-X₂, X₁, X₂) :|: 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: 0 ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀ ≤ X₁

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₅: l4(X₀, X₁, X₂) → l1(X₀-X₂, X₁, X₂) :|: 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀

All Bounds

Timebounds

Overall timebound:7 {O(1)}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₆: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₅: 1 {O(1)}

Costbounds

Overall costbound: 7 {O(1)}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₆: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₅: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₃, X₀: X₁ {O(n)}
t₃, X₁: X₁ {O(n)}
t₃, X₂: X₂ {O(n)}
t₄, X₀: X₁+X₂ {O(n)}
t₄, X₁: 2⋅X₁ {O(n)}
t₄, X₂: 2⋅X₂ {O(n)}
t₆, X₀: X₀+X₁+X₂ {O(n)}
t₆, X₁: 3⋅X₁ {O(n)}
t₆, X₂: 3⋅X₂ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₂, X₂: X₂ {O(n)}
t₅, X₀: X₂ {O(n)}
t₅, X₁: X₁ {O(n)}
t₅, X₂: X₂ {O(n)}