/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, l5, true>
<l1, l2, true>
<l2, l3, (undef4 = (~(1) + x_5^0)) /\ ((0 + undef4) <= 0), par{x_5^0 -> undef4}>
<l3, l2, true>
<l2, l4, (undef8 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef8)) /\ (undef7 = undef7), par{Result_4^0 -> undef7, x_5^0 -> undef8}>
<l5, l1, true>

Fresh variables:
undef4, undef7, undef8, 

Undef variables:
undef4, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l2, (undef4 = (~(1) + x_5^0)) /\ ((0 + undef4) <= 0), par{x_5^0 -> undef4}>
<l2, l4, (undef8 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef8)) /\ (undef7 = undef7), par{x_5^0 -> undef8}>

Fresh variables:
undef4, undef7, undef8, 

Undef variables:
undef4, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, undef4 <= 0 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
Variables:
x_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l4, 1 <= undef8 /\ x_5^0 = 1 + undef8, {x_5^0 -> undef8, rest remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.001382

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000533s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001565s
[61077 : 61078]
[61077 : 61079]
Successful child: 61078
[ 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: 
<l2, l2, undef4 <= 0 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, undef4 <= 0 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000324s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 2 <= x_5^0 , 
Narrowing transition: 
<l2, l2, undef4 <= 0 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000564s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001836s
[61077 : 61083]
[61077 : 61084]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010573s
Time used: 0.010569

LOG: SAT solveNonLinear - Elapsed time: 0.015737s
Cost: 1; Total time: 0.015383
Quasi-ranking function: 50000 + x_5^0
New Graphs: 
Transitions:
<l2, l2, undef4 <= 0 /\ 50001 + x_5^0 <= 0 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}>
Variables:
x_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000541s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001940s
[61077 : 61088]
[61077 : 61089]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004391s
Time used: 0.004067

[61077 : 61093]
[61077 : 61097]
Successful child: 61093

Program does NOT terminate