Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: X₂ < 0
t₁: l1(X₀, X₁, X₂) → l1(X₀+(X₁)²*X₂, X₁-2⋅(X₂)², X₂) :|: 0 < X₀+(X₁)²
Found invariant 1+X₂ ≤ 0 for location l1
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: X₂ < 0
t₁: l1(X₀, X₁, X₂) → l1(X₀+(X₁)²*X₂, X₁-2⋅(X₂)², X₂) :|: 0 < X₀+(X₁)² ∧ 1+X₂ ≤ 0
Found invariant 1+X₂ ≤ 0 for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₀: X₀ {O(n)}
X₁: X₁ {O(n)}
X₂: X₂ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 12⋅X₂⋅X₂⋅X₂⋅X₂⋅X₂+12⋅X₁⋅X₂⋅X₂⋅X₂+24⋅X₂⋅X₂⋅X₂⋅X₂+24⋅X₁⋅X₂⋅X₂+6⋅X₁⋅X₁+6⋅X₀+6 {O(n^5)}
Eliminate variables {NoDet0,NoDet1,X₀,X₁} that do not contribute to the problem
Found invariant 1+X₂ ≤ 0 for location l1
Found invariant 1+X₂ ≤ 0 for location n_l1___1
Overall timebound:12⋅X₂⋅X₂⋅X₂⋅X₂⋅X₂+12⋅X₁⋅X₂⋅X₂⋅X₂+24⋅X₂⋅X₂⋅X₂⋅X₂+24⋅X₁⋅X₂⋅X₂+6⋅X₁⋅X₁+6⋅X₀+7 {O(n^5)}
t₀: 1 {O(1)}
t₁: 12⋅X₂⋅X₂⋅X₂⋅X₂⋅X₂+12⋅X₁⋅X₂⋅X₂⋅X₂+24⋅X₂⋅X₂⋅X₂⋅X₂+24⋅X₁⋅X₂⋅X₂+6⋅X₁⋅X₁+6⋅X₀+6 {O(n^5)}
Overall costbound: 12⋅X₂⋅X₂⋅X₂⋅X₂⋅X₂+12⋅X₁⋅X₂⋅X₂⋅X₂+24⋅X₂⋅X₂⋅X₂⋅X₂+24⋅X₁⋅X₂⋅X₂+6⋅X₁⋅X₁+6⋅X₀+7 {O(n^5)}
t₀: 1 {O(1)}
t₁: 12⋅X₂⋅X₂⋅X₂⋅X₂⋅X₂+12⋅X₁⋅X₂⋅X₂⋅X₂+24⋅X₂⋅X₂⋅X₂⋅X₂+24⋅X₁⋅X₂⋅X₂+6⋅X₁⋅X₁+6⋅X₀+6 {O(n^5)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₂: X₂ {O(n)}