Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4
Transitions:
t₂: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₁+1) :|: 0 ≤ X₁ ∧ X₁ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃) → l2(E, X₁, X₂, X₃) :|: X₃+1 ≤ X₁
t₄: l1(X₀, X₁, X₂, X₃) → l2(E, X₁, X₂, X₃) :|: 1+X₁ ≤ X₃
t₈: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₁) :|: X₁ ≤ X₃ ∧ X₃ ≤ X₁
t₇: l2(X₀, X₁, X₂, X₃) → l3(0, X₁, X₂, X₃) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₀: l2(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀+1 ≤ 0
t₁: l2(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 1 ≤ X₀
t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃+1) :|: X₃ ≤ X₂
t₆: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, 0) :|: 1+X₂ ≤ X₃
Found invariant X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l2
Found invariant X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l1
Found invariant X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l4
Found invariant X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4
Transitions:
t₂: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₁+1) :|: 0 ≤ X₁ ∧ X₁ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃) → l2(E, X₁, X₂, X₃) :|: X₃+1 ≤ X₁ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₄: l1(X₀, X₁, X₂, X₃) → l2(E, X₁, X₂, X₃) :|: 1+X₁ ≤ X₃ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₈: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₁) :|: X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₇: l2(X₀, X₁, X₂, X₃) → l3(0, X₁, X₂, X₃) :|: X₀ ≤ 0 ∧ 0 ≤ X₀ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₀: l2(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀+1 ≤ 0 ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₁: l2(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 1 ≤ X₀ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃+1) :|: X₃ ≤ X₂ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
t₆: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, 0) :|: 1+X₂ ≤ X₃ ∧ X₃ ≤ 1+X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁
Cut unsatisfiable transition t₈: l1→l3
Cut unsatisfiable transition t₄₉₁: n_l1___15→l3
Cut unsatisfiable transition t₄₄₈: n_l1___7→n_l2___5
Cut unreachable locations [n_l2___5; n_l4___1; n_l4___2] from the program graph
Found invariant 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₁ for location n_l2___6
Found invariant X₃ ≤ 1+X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 2+X₀ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l4___17
Found invariant 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___3
Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1+X₀+X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l4___9
Found invariant 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 2+X₀ ≤ X₃ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 3+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l4___4
Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₁ for location n_l1___7
Found invariant X₃ ≤ 1+X₂ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₁ ≤ X₃ ∧ 3+X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l4___12
Found invariant X₃ ≤ 1+X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___16
Found invariant X₃ ≤ 1+X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location n_l2___18
Found invariant X₃ ≤ 1+X₂ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location n_l1___15
Found invariant X₃ ≤ 1+X₂ ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l1
Found invariant X₃ ≤ 0 ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location n_l1___14
Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₁ for location n_l2___10
Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___8
Found invariant X₃ ≤ 1+X₂ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l3
Found invariant X₃ ≤ 1+X₂ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location n_l2___13
Found invariant X₃ ≤ 1+X₂ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___11
Overall timebound:inf {Infinity}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: inf {Infinity}
t₈: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₇: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: inf {Infinity}
t₈: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₇: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
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₁: 2⋅X₁ {O(n)}
t₈, X₂: 2⋅X₂ {O(n)}
t₈, X₃: 2⋅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₁: 2⋅X₁ {O(n)}
t₇, X₂: 2⋅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)}