/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, l6, true>
<l1, l2, (0 <= (0 + b^0)), par{b^0 -> 1}>
<l2, l3, (undef3 = __disjvr_0^0) /\ (__disjvr_0^0 = undef3), par{__disjvr_0^0 -> undef3}>
<l3, l4, true, par{b^0 -> 0}>
<l4, l1, true>
<l5, l1, true>
<l6, l5, true>

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l1, (0 <= (0 + b^0)) /\ (undef3 = __disjvr_0^0) /\ (__disjvr_0^0 = undef3), par{__disjvr_0^0 -> undef3, b^0 -> 0}>

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 0 <= b^0 /\ __disjvr_0^0 = undef3, {__disjvr_0^0 -> undef3, b^0 -> 0, rest remain the same}>
Variables:
__disjvr_0^0, b^0

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {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: 0.001776

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000532s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001635s
[62326 : 62327]
[62326 : 62328]
Successful child: 62327
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 0 <= b^0 /\ __disjvr_0^0 = undef3, {__disjvr_0^0 -> undef3, b^0 -> 0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 0 <= b^0 /\ __disjvr_0^0 = undef3, {__disjvr_0^0 -> undef3, b^0 -> 0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + b^0 <= 0 - Process 1
* Exit transition: <l0, l1, true, {all remain the same}>
* Postcondition  : 1 + b^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000310s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + b^0 <= 0 , 
Narrowing transition: 
<l1, l1, 0 <= b^0 /\ __disjvr_0^0 = undef3, {__disjvr_0^0 -> undef3, b^0 -> 0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 0 <= b^0 /\ __disjvr_0^0 = undef3, {__disjvr_0^0 -> undef3, b^0 -> 0, rest remain the same}>
Variables:
__disjvr_0^0, b^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000535s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001664s
[62326 : 62332]
[62326 : 62333]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004865s
Time used: 0.004614

[62326 : 62337]
[62326 : 62341]
Successful child: 62341

Program does NOT terminate