/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, ((0 + ox^0) <= (0 + x^0)) /\ ((0 + oy^0) <= (0 + y^0))>
<l1, l3, true, par{x^0 -> (0 + x^0)}>
<l4, l3, ((0 + c^0) <= 0)>
<l4, l3, true, par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + y^0)}>
<l5, l4, ((0 + c^0) <= 0)>
<l5, l1, (1 <= (0 + c^0))>
<l6, l5, true, par{y^0 -> (~(1) + y^0)}>
<l6, l5, true, par{x^0 -> (~(1) + x^0)}>
<l3, l6, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0))>
<l7, l3, ((0 + c^0) <= 0)>
<l8, l7, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, ((0 + c^0) <= 0)>
<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{y^0 -> (~(1) + y^0)}>
<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + (~(1) + y^0)), y^0 -> (~(1) + y^0)}>
<l3, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + x^0)) /\ ((0 + oy^0) <= (0 + (~(1) + y^0))), par{y^0 -> (~(1) + y^0)}>
<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)), par{x^0 -> (0 + x^0), y^0 -> (~(1) + y^0)}>
<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{x^0 -> (~(1) + x^0)}>
<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + (~(1) + x^0)), oy^0 -> (0 + y^0), x^0 -> (~(1) + x^0)}>
<l3, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + (~(1) + x^0))) /\ ((0 + oy^0) <= (0 + y^0)), par{x^0 -> (~(1) + x^0)}>
<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)), par{x^0 -> (0 + (~(1) + x^0))}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {c^0 -> 1, ox^0 -> x^0, oy^0 -> -1 + y^0, y^0 -> -1 + y^0, rest remain the same}>
<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {c^0 -> 1, ox^0 -> -1 + x^0, oy^0 -> y^0, x^0 -> -1 + x^0, rest remain the same}>
<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
c^0, x^0, y^0, ox^0, oy^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, c^0 <= 0, {all remain the same}>

Graph 2
<l3, l2, ox^0 <= x^0 /\ 1 <= c^0 /\ 1 + oy^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l3, l2, oy^0 <= y^0 /\ 1 <= c^0 /\ 1 + ox^0 <= x^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 2 )
( 3 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.024185

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005256s
Ranking function: -1 - 4*c^0 + y^0
New Graphs: 
Transitions:
<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
c^0, x^0, y^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001749s
Ranking function: -4 + 3*c^0 + y^0
New Graphs: 
Transitions:
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
c^0, x^0, y^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001290s
Ranking function: -4 + 3*c^0 + x^0
New Graphs: 
Transitions:
<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
c^0, x^0, y^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000806s
Ranking function: -1 + x^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates