Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l1(X₀, X₁) :|: 0 < X₀ ∧ X₀ < 1
t₃: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 0 < X₀ ∧ 1 ≤ X₀
t₄: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₀ ≤ 0 ∧ X₀ < 0
t₅: l1(X₀, X₁) → l1(X₀, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)
Cut unsatisfiable transition t₂: l1→l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₃: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 0 < X₀ ∧ 1 ≤ X₀
t₄: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₀ ≤ 0 ∧ X₀ < 0
t₅: l1(X₀, X₁) → l1(X₀, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)
Termination: true
Formula:
relevant size-bounds w.r.t. t₁:
X₀: X₁ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 4⋅X₁+6 {O(n)}
Termination: true
Formula:
relevant size-bounds w.r.t. t₁:
X₀: X₁ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 4⋅X₁+6 {O(n)}
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Cut unsatisfiable transition t₉₇: n_l1___3→n_l1___4
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___4
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___2
Found invariant 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 for location n_l1___3
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___1
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___4
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___2
Found invariant 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 for location n_l1___3
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___1
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___4
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___2
Found invariant 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 for location n_l1___3
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___1
Termination: true
Formula:
relevant size-bounds w.r.t. t₁₀₁:
X₀: X₁ {O(n)}
Runtime-bound of t₁₀₁: 1 {O(1)}
Results in: 2⋅X₁+4 {O(n)}
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___4
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___2
Found invariant 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 for location n_l1___3
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___1
Termination: true
Formula:
relevant size-bounds w.r.t. t₁₀₂:
X₀: X₁ {O(n)}
Runtime-bound of t₁₀₂: 1 {O(1)}
Results in: 4⋅X₁+6 {O(n)}
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___4
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___2
Found invariant 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 for location n_l1___3
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₃: 4⋅X₁+6 {O(n)}
t₄: 4⋅X₁+6 {O(n)}
t₅: inf {Infinity}
t₁: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₃: 4⋅X₁+6 {O(n)}
t₄: 4⋅X₁+6 {O(n)}
t₅: inf {Infinity}
t₁: 1 {O(1)}
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₀: 0 {O(1)}
t₅, X₁: 3⋅X₁ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}