/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, l5, true>
<l1, l2, ((1 + __const_10^0) <= (0 + x^0))>
<l1, l3, ((0 + x^0) <= (0 + __const_10^0)), par{x^0 -> (1 + x^0), y^0 -> ((0 + __const_10^0) + (~(1) * x^0))}>
<l3, l1, true>
<l4, l3, true, par{x^0 -> 1}>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (x^0 = 1)>
<l3, l2, ((1 + __const_10^0) <= (0 + x^0))>
<l3, l3, ((0 + x^0) <= (0 + __const_10^0)), par{x^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, x^0 <= __const_10^0, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
__const_10^0, x^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l3, l2, 1 + __const_10^0 <= x^0, {all 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.001853

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates