/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, l6, true>
<l1, l2, (((1 + (~(1) * __const_21^0)) + x_5^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
<l1, l3, (0 <= ((0 + (~(1) * __const_21^0)) + x_5^0))>
<l4, l1, true>
<l3, l1, (((1 + (~(1) * __const_31^0)) + y_6^0) <= 0), par{x_5^0 -> (~(1) + x_5^0)}>
<l3, l5, (0 <= ((0 + (~(1) * __const_31^0)) + y_6^0)), par{y_6^0 -> (~(1) + y_6^0)}>
<l5, l3, true>
<l6, l4, true>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (((1 + (~(1) * __const_21^0)) + x_5^0) <= 0) /\ (undef1 = undef1)>
<l0, l3, (0 <= ((0 + (~(1) * __const_21^0)) + x_5^0))>
<l3, l2, (((1 + (~(1) * __const_31^0)) + y_6^0) <= 0) /\ (((1 + (~(1) * __const_21^0)) + (~(1) + x_5^0)) <= 0) /\ (undef1 = undef1), par{x_5^0 -> (~(1) + x_5^0)}>
<l3, l3, (((1 + (~(1) * __const_31^0)) + y_6^0) <= 0) /\ (0 <= ((0 + (~(1) * __const_21^0)) + (~(1) + x_5^0))), par{x_5^0 -> (~(1) + x_5^0)}>
<l3, l3, (0 <= ((0 + (~(1) * __const_31^0)) + y_6^0)), par{y_6^0 -> (~(1) + y_6^0)}>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + __const_21^0 <= x_5^0 /\ 1 + y_6^0 <= __const_31^0, {x_5^0 -> -1 + x_5^0, rest remain the same}>
<l3, l3, __const_31^0 <= y_6^0, {y_6^0 -> -1 + y_6^0, rest remain the same}>
Variables:
__const_21^0, __const_31^0, x_5^0, y_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l0, l2, 1 + x_5^0 <= __const_21^0, {all remain the same}>
<l3, l2, 1 + y_6^0 <= __const_31^0 /\ x_5^0 <= __const_21^0, {x_5^0 -> -1 + x_5^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.005107

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001309s
Ranking function: -__const_31^0 + y_6^0
New Graphs: 
Transitions:
<l3, l3, 1 + __const_21^0 <= x_5^0 /\ 1 + y_6^0 <= __const_31^0, {x_5^0 -> -1 + x_5^0, rest remain the same}>
Variables:
__const_21^0, __const_31^0, x_5^0, y_6^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates