Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₃: l1(X₀, X₁, X₂) → l4(X₂-1, X₁, X₂)
t₁: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₂: l3(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₄: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₅: l5(X₀, X₁, X₂) → l6(X₀, X₁, X₂)
t₆: l6(X₀, X₁, X₂) → l7(X₀, X₀, X₂)
t₇: l7(X₀, X₁, X₂) → l8(X₀, X₁, X₂) :|: 1 < X₁
t₈: l7(X₀, X₁, X₂) → l9(X₀, X₁, X₂) :|: X₁ ≤ 1
t₉: l8(X₀, X₁, X₂) → l7(X₀, X₁-1, X₂)
t₁₀: l9(X₀, X₁, X₂) → l10(X₀, X₁, X₂)

Preprocessing

Found invariant X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ for location l6

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

Found invariant X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ for location l5

Found invariant X₂ ≤ 1+X₀ ∧ 3 ≤ X₂ ∧ 5 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l8

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

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

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

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₃: l1(X₀, X₁, X₂) → l4(X₂-1, X₁, X₂)
t₁: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₂: l3(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₄: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂
t₅: l5(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂
t₆: l6(X₀, X₁, X₂) → l7(X₀, X₀, X₂) :|: X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂
t₇: l7(X₀, X₁, X₂) → l8(X₀, X₁, X₂) :|: 1 < X₁ ∧ X₂ ≤ 1+X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀
t₈: l7(X₀, X₁, X₂) → l9(X₀, X₁, X₂) :|: X₁ ≤ 1 ∧ X₂ ≤ 1+X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀
t₉: l8(X₀, X₁, X₂) → l7(X₀, X₁-1, X₂) :|: X₂ ≤ 1+X₀ ∧ 3 ≤ X₂ ∧ 5 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀
t₁₀: l9(X₀, X₁, X₂) → l10(X₀, X₁, X₂) :|: X₂ ≤ 1+X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ 1 ∧ X₁ ≤ X₀

Found invariant X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ for location l6

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

Found invariant X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ for location l5

Found invariant X₂ ≤ 1+X₀ ∧ 3 ≤ X₂ ∧ 5 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l8

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

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

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

Time-Bound by TWN-Loops:

TWN-Loops: t₇ 2⋅X₂+8 {O(n)}

TWN-Loops:

entry: t₆: l6(X₀, X₁, X₂) → l7(X₀, X₀, X₂) :|: X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂
results in twn-loop: twn:Inv: [X₂ ≤ 1+X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 3 ≤ X₂ ∧ 5 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀] , (X₀,X₁,X₂) -> (X₀,X₁-1,X₂) :|: 1 < X₁
order: [X₀; X₁; X₂]
closed-form:
X₀: X₀
X₁: X₁ + [[n != 0]] * -1 * n^1
X₂: X₂

Termination: true
Formula:

1 < 0
∨ 1 < X₁ ∧ 1 ≤ 0 ∧ 0 ≤ 1

Stabilization-Threshold for: 1 < X₁
alphas_abs: 1+X₁
M: 0
N: 1
Bound: 2⋅X₁+4 {O(n)}

relevant size-bounds w.r.t. t₆:
X₁: X₂+1 {O(n)}
Runtime-bound of t₆: 1 {O(1)}
Results in: 2⋅X₂+8 {O(n)}

2⋅X₂+8 {O(n)}

Time-Bound by TWN-Loops:

TWN-Loops: t₉ 2⋅X₂+8 {O(n)}

relevant size-bounds w.r.t. t₆:
X₁: X₂+1 {O(n)}
Runtime-bound of t₆: 1 {O(1)}
Results in: 2⋅X₂+8 {O(n)}

2⋅X₂+8 {O(n)}

All Bounds

Timebounds

Overall timebound:4⋅X₂+25 {O(n)}
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)}
t₇: 2⋅X₂+8 {O(n)}
t₈: 1 {O(1)}
t₉: 2⋅X₂+8 {O(n)}
t₁₀: 1 {O(1)}

Costbounds

Overall costbound: 4⋅X₂+25 {O(n)}
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)}
t₇: 2⋅X₂+8 {O(n)}
t₈: 1 {O(1)}
t₉: 2⋅X₂+8 {O(n)}
t₁₀: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₃, X₀: X₂+1 {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₂+1 {O(n)}
t₄, X₁: X₁ {O(n)}
t₄, X₂: X₂ {O(n)}
t₅, X₀: X₂+1 {O(n)}
t₅, X₁: X₁ {O(n)}
t₅, X₂: X₂ {O(n)}
t₆, X₀: X₂+1 {O(n)}
t₆, X₁: X₂+1 {O(n)}
t₆, X₂: X₂ {O(n)}
t₇, X₀: X₂+1 {O(n)}
t₇, X₁: X₂+1 {O(n)}
t₇, X₂: X₂ {O(n)}
t₈, X₀: 2⋅X₂+2 {O(n)}
t₈, X₁: 2⋅X₂+2 {O(n)}
t₈, X₂: 2⋅X₂ {O(n)}
t₉, X₀: X₂+1 {O(n)}
t₉, X₁: X₂+1 {O(n)}
t₉, X₂: X₂ {O(n)}
t₁₀, X₀: 2⋅X₂+2 {O(n)}
t₁₀, X₁: 2⋅X₂+2 {O(n)}
t₁₀, X₂: 2⋅X₂ {O(n)}