Initial Problem

Start: eval_easy2_start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: eval_easy2_bb0_in, eval_easy2_bb1_in, eval_easy2_bb2_in, eval_easy2_bb3_in, eval_easy2_start, eval_easy2_stop
Transitions:
t₁: eval_easy2_bb0_in(X₀, X₁) → eval_easy2_bb1_in(X₁, X₁)
t₂: eval_easy2_bb1_in(X₀, X₁) → eval_easy2_bb2_in(X₀, X₁) :|: 1 ≤ X₀
t₃: eval_easy2_bb1_in(X₀, X₁) → eval_easy2_bb3_in(X₀, X₁) :|: X₀ ≤ 0
t₄: eval_easy2_bb2_in(X₀, X₁) → eval_easy2_bb1_in(X₀-1, X₁)
t₅: eval_easy2_bb3_in(X₀, X₁) → eval_easy2_stop(X₀, X₁)
t₀: eval_easy2_start(X₀, X₁) → eval_easy2_bb0_in(X₀, X₁)

Preprocessing

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location eval_easy2_bb2_in

Found invariant X₀ ≤ X₁ ∧ X₀ ≤ 0 for location eval_easy2_bb3_in

Found invariant X₀ ≤ X₁ ∧ X₀ ≤ 0 for location eval_easy2_stop

Found invariant X₀ ≤ X₁ for location eval_easy2_bb1_in

Problem after Preprocessing

Start: eval_easy2_start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: eval_easy2_bb0_in, eval_easy2_bb1_in, eval_easy2_bb2_in, eval_easy2_bb3_in, eval_easy2_start, eval_easy2_stop
Transitions:
t₁: eval_easy2_bb0_in(X₀, X₁) → eval_easy2_bb1_in(X₁, X₁)
t₂: eval_easy2_bb1_in(X₀, X₁) → eval_easy2_bb2_in(X₀, X₁) :|: 1 ≤ X₀ ∧ X₀ ≤ X₁
t₃: eval_easy2_bb1_in(X₀, X₁) → eval_easy2_bb3_in(X₀, X₁) :|: X₀ ≤ 0 ∧ X₀ ≤ X₁
t₄: eval_easy2_bb2_in(X₀, X₁) → eval_easy2_bb1_in(X₀-1, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁
t₅: eval_easy2_bb3_in(X₀, X₁) → eval_easy2_stop(X₀, X₁) :|: X₀ ≤ 0 ∧ X₀ ≤ X₁
t₀: eval_easy2_start(X₀, X₁) → eval_easy2_bb0_in(X₀, X₁)

MPRF for transition t₂: eval_easy2_bb1_in(X₀, X₁) → eval_easy2_bb2_in(X₀, X₁) :|: 1 ≤ X₀ ∧ X₀ ≤ X₁ of depth 1:

new bound:

X₁ {O(n)}

• eval_easy2_bb1_in: [X₀]
• eval_easy2_bb2_in: [X₀-1]

MPRF for transition t₄: eval_easy2_bb2_in(X₀, X₁) → eval_easy2_bb1_in(X₀-1, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ of depth 1:

new bound:

X₁ {O(n)}

• eval_easy2_bb1_in: [X₀]
• eval_easy2_bb2_in: [X₀]

All Bounds

Timebounds

Overall timebound:2⋅X₁+4 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₁ {O(n)}
t₃: 1 {O(1)}
t₄: X₁ {O(n)}
t₅: 1 {O(1)}

Costbounds

Overall costbound: 2⋅X₁+4 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₁ {O(n)}
t₃: 1 {O(1)}
t₄: X₁ {O(n)}
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₀: X₁ {O(n)}
t₂, X₁: 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₀: 2⋅X₁ {O(n)}
t₅, X₁: 2⋅X₁ {O(n)}