Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀)
t₁: l1(X₀) → l1(X₀-1) :|: X₀ ≤ 0
t₂: l1(X₀) → l1(X₀-1) :|: 1 ≤ X₀
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀)
t₁: l1(X₀) → l1(X₀-1) :|: X₀ ≤ 0
t₂: l1(X₀) → l1(X₀-1) :|: 1 ≤ X₀
Found invariant 1+X₀ ≤ 0 for location n_l1___2
Found invariant 0 ≤ X₀ for location n_l1___1
Found invariant 1+X₀ ≤ 0 for location n_l1___2
Found invariant 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₀ ≤ 0 for location n_l1___2
Found invariant 0 ≤ X₀ for location n_l1___1
Overall timebound: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₀, X₀: X₀ {O(n)}
t₂, X₀: X₀ {O(n)}