Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: F, G
Locations: l0, l1, l2, l3, l4
Transitions:
t₄: l0(X₀, X₁, X₂, X₃, X₄) → l1(F, 0, F, G, X₄) :|: F ≤ 100 ∧ 1 ≤ F
t₂: l0(X₀, X₁, X₂, X₃, X₄) → l2(F, X₁, F, X₃, X₄) :|: F ≤ 0
t₃: l0(X₀, X₁, X₂, X₃, X₄) → l2(F, X₁, F, X₃, X₄) :|: 101 ≤ F
t₀: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: X₁+1 ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁
t₈: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₀-1, X₂, X₃, 0) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁+1, X₂, X₃, X₄)
t₉: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁-1, X₂, X₃, 0)
t₇: l4(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ X₄
t₆: l4(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄+1) :|: X₄+1 ≤ X₁

Preprocessing

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

Found invariant X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l1

Found invariant X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l4

Found invariant X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l3

Cut unsatisfiable transition t₂₃: l1→l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₄
Temp_Vars: F
Locations: l0, l1, l2, l3, l4
Transitions:
t₂₁: l0(X₀, X₁, X₄) → l1(F, 0, X₄) :|: F ≤ 100 ∧ 1 ≤ F
t₁₉: l0(X₀, X₁, X₄) → l2(F, X₁, X₄) :|: F ≤ 0
t₂₀: l0(X₀, X₁, X₄) → l2(F, X₁, X₄) :|: 101 ≤ F
t₂₂: l1(X₀, X₁, X₄) → l3(X₀, X₁, X₄) :|: X₁+1 ≤ X₀ ∧ X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
t₂₄: l1(X₀, X₁, X₄) → l4(X₀, X₀-1, 0) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
t₂₅: l3(X₀, X₁, X₄) → l1(X₀, X₁+1, X₄) :|: X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
t₂₆: l3(X₀, X₁, X₄) → l4(X₀, X₁-1, 0) :|: X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
t₂₈: l4(X₀, X₁, X₄) → l2(X₀, X₁, X₄) :|: X₁ ≤ X₄ ∧ X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
t₂₇: l4(X₀, X₁, X₄) → l4(X₀, X₁, X₄+1) :|: X₄+1 ≤ X₁ ∧ X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀

Found invariant X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l1

Found invariant X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l4

Found invariant X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l3

Time-Bound by TWN-Loops:

TWN-Loops: t₂₂ 204 {O(1)}

TWN-Loops:

entry: t₂₁: l0(X₀, X₁, X₄) → l1(F, 0, X₄) :|: F ≤ 100 ∧ 1 ≤ F
results in twn-loop: twn:Inv: [X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀] , (X₀,X₁,X₄) -> (X₀,X₁+1,X₄) :|: X₁+1 ≤ X₀
order: [X₀; X₁]
closed-form:
X₀: X₀
X₁: X₁ + [[n != 0]] * n^1

Termination: true
Formula:

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

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

relevant size-bounds w.r.t. t₂₁:
X₀: 100 {O(1)}
Runtime-bound of t₂₁: 1 {O(1)}
Results in: 204 {O(1)}

204 {O(1)}

Time-Bound by TWN-Loops:

TWN-Loops: t₂₅ 204 {O(1)}

relevant size-bounds w.r.t. t₂₁:
X₀: 100 {O(1)}
Runtime-bound of t₂₁: 1 {O(1)}
Results in: 204 {O(1)}

204 {O(1)}

Found invariant X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l1

Found invariant X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 197 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 98+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 98 ∧ 2+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 198 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l4

Found invariant X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l3

Found invariant X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l1

Found invariant X₄ ≤ 99 ∧ X₄ ≤ X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l4

Found invariant X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀ for location l3

Time-Bound by TWN-Loops:

TWN-Loops: t₂₇ 404 {O(1)}

TWN-Loops:

entry: t₂₆: l3(X₀, X₁, X₄) → l4(X₀, X₁-1, 0) :|: X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
results in twn-loop: twn:Inv: [X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀] , (X₀,X₁,X₄) -> (X₀,X₁,X₄+1) :|: X₄+1 ≤ X₁
entry: t₂₄: l1(X₀, X₁, X₄) → l4(X₀, X₀-1, 0) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₁ ≤ 100 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 200 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 100+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀
results in twn-loop: twn:Inv: [X₄ ≤ 99 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 198 ∧ 1+X₄ ≤ X₀ ∧ X₀+X₄ ≤ 199 ∧ 0 ≤ X₄ ∧ 0 ≤ 1+X₁+X₄ ∧ X₁ ≤ 99+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₀ ≤ 100+X₄ ∧ X₁ ≤ 99 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 199 ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 101+X₁ ∧ X₀ ≤ 100 ∧ 1 ≤ X₀] , (X₀,X₁,X₄) -> (X₀,X₁,X₄+1) :|: X₄+1 ≤ X₁
order: [X₀; X₁; X₄]
closed-form:
X₀: X₀
X₁: X₁
X₄: X₄ + [[n != 0]] * n^1

Termination: true
Formula:

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

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

relevant size-bounds w.r.t. t₂₆:
X₁: 98 {O(1)}
Runtime-bound of t₂₆: 1 {O(1)}
Results in: 200 {O(1)}

order: [X₀; X₁; X₄]
closed-form:
X₀: X₀
X₁: X₁
X₄: X₄ + [[n != 0]] * n^1

Termination: true
Formula:

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

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

relevant size-bounds w.r.t. t₂₄:
X₁: 99 {O(1)}
X₄: 0 {O(1)}
Runtime-bound of t₂₄: 1 {O(1)}
Results in: 204 {O(1)}

404 {O(1)}

All Bounds

Timebounds

Overall timebound:818 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: 204 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 204 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 404 {O(1)}
t₂₈: 1 {O(1)}

Costbounds

Overall costbound: 818 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: 204 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 204 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 404 {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₀: 100 {O(1)}
t₂₁, X₁: 0 {O(1)}
t₂₁, X₄: X₄ {O(n)}
t₂₂, X₀: 100 {O(1)}
t₂₂, X₁: 99 {O(1)}
t₂₂, X₄: X₄ {O(n)}
t₂₄, X₀: 100 {O(1)}
t₂₄, X₁: 99 {O(1)}
t₂₄, X₄: 0 {O(1)}
t₂₅, X₀: 100 {O(1)}
t₂₅, X₁: 100 {O(1)}
t₂₅, X₄: X₄ {O(n)}
t₂₆, X₀: 100 {O(1)}
t₂₆, X₁: 98 {O(1)}
t₂₆, X₄: 0 {O(1)}
t₂₇, X₀: 100 {O(1)}
t₂₇, X₁: 99 {O(1)}
t₂₇, X₄: 99 {O(1)}
t₂₈, X₀: 100 {O(1)}
t₂₈, X₁: 99 {O(1)}
t₂₈, X₄: 99 {O(1)}