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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (x^0 = 300)>
<l1, l1, ((1 + (~(1) + x^0)) <= 100), par{x^0 -> (~(1) + x^0)}>
<l1, l1, (101 <= (0 + (~(1) + x^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:
<l1, l1, x^0 <= 100, {x^0 -> -1 + x^0, rest remain the same}>
<l1, l1, 102 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

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

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 1.98756
Some transition disabled by a set of invariant(s):
Invariant at l1: 101 <= x^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, x^0 <= 100, {x^0 -> -1 + x^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 102 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.032763

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001348s
Ranking function: -102 + x^0
New Graphs: 
Program Terminates