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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (undef1 = (300 + x^0)) /\ (101 <= (0 + undef1)), par{x^0 -> undef1}>
<l2, l1, (undef2 = (400 + x^0)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}>
<l3, l1, (undef3 = (200 + x^0)) /\ (101 <= (0 + undef3)), par{x^0 -> undef3}>
<l3, l2, (undef4 = (100 + x^0)) /\ (101 <= (0 + undef4)), par{x^0 -> undef4}>
<l4, l3, true>

Fresh variables:
undef1, undef2, undef3, undef4, 

Undef variables:
undef1, undef2, undef3, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (undef3 = (200 + x^0)) /\ (101 <= (0 + undef3)), par{x^0 -> undef3}>
<l0, l1, (undef4 = (100 + x^0)) /\ (101 <= (0 + undef4)) /\ (undef2 = (400 + undef4)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}>
<l1, l1, (undef1 = (300 + x^0)) /\ (101 <= (0 + undef1)) /\ (undef2 = (400 + undef1)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}>

Fresh variables:
undef1, undef2, undef3, undef4, 

Undef variables:
undef1, undef2, undef3, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
<l0, l1, 101 <= undef2 /\ 101 <= undef4 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest 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: 0.001964

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000707s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002469s
[33051 : 33052]
[33051 : 33053]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006895s
Time used: 0.006408
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019048s
Time used: 0.019043

LOG: SAT solveNonLinear - Elapsed time: 0.025943s
Cost: 1; Total time: 0.025451
Termination implied by a set of invariant(s):
Invariant at l1: 1 <= x^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 1 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 1 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
Quasi-ranking function: 50000 - x^0
New Graphs: 
Transitions:
<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 50001 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
Variables:
x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000720s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002869s
[33051 : 33057]
[33051 : 33058]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005948s
Time used: 0.005574
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000668s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000747s
Cannot prove unreachability

[33051 : 33062]
[33051 : 33063]
Successful child: 33063

Program does NOT terminate