/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, l13, true>
<l1, l2, (undef5 = undef5) /\ (undef8 = (0 + undef5)), par{nondet_7^0 -> undef5, temp6_11^0 -> undef8, x_10^0 -> (0 + undef8)}>
<l3, l4, (undef15 = undef15) /\ (undef16 = (0 + undef15)) /\ ((0 + undef16) <= 0) /\ (0 <= (0 + undef16)) /\ (undef10 = undef10), par{Result_6^0 -> undef10, nondet_8^0 -> undef15, temp5_9^0 -> undef16}>
<l3, l5, (undef24 = undef24), par{nondet_8^0 -> undef24, temp5_9^0 -> (0 + undef24)}>
<l5, l6, (undef29 = __disjvr_0^0) /\ (__disjvr_0^0 = undef29), par{__disjvr_0^0 -> undef29}>
<l6, l7, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l7, l4, (undef51 = undef51) /\ (undef52 = (0 + undef51)) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52)) /\ (undef46 = undef46), par{Result_6^0 -> undef46, nondet_8^0 -> undef51, temp5_9^0 -> undef52}>
<l7, l8, (undef60 = undef60), par{nondet_8^0 -> undef60, temp5_9^0 -> (0 + undef60)}>
<l8, l9, (undef66 = __disjvr_1^0) /\ (__disjvr_1^0 = undef66), par{__disjvr_1^0 -> undef66}>
<l9, l10, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l10, l7, true>
<l2, l4, (undef96 = undef96) /\ (undef97 = (0 + undef96)) /\ ((0 + undef97) <= 0) /\ (0 <= (0 + undef97)) /\ (undef91 = undef91), par{Result_6^0 -> undef91, nondet_8^0 -> undef96, temp5_9^0 -> undef97}>
<l2, l11, (undef105 = undef105), par{nondet_8^0 -> undef105, temp5_9^0 -> (0 + undef105)}>
<l11, l12, (undef112 = __disjvr_2^0) /\ (__disjvr_2^0 = undef112), par{__disjvr_2^0 -> undef112}>
<l12, l7, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l13, l1, true>

Fresh variables:
undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 

Undef variables:
undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef5 = undef5) /\ (undef8 = (0 + undef5)) /\ (undef96 = undef96) /\ (undef97 = (0 + undef96)) /\ ((0 + undef97) <= 0) /\ (0 <= (0 + undef97)) /\ (undef91 = undef91), par{x_10^0 -> (0 + undef8)}>
<l0, l7, (undef5 = undef5) /\ (undef8 = (0 + undef5)) /\ (undef105 = undef105) /\ (undef112 = __disjvr_2^0) /\ (__disjvr_2^0 = undef112) /\ (0 <= (~(1) + (0 + undef8))), par{__disjvr_2^0 -> undef112, x_10^0 -> (1 + (0 + undef8))}>
<l7, l4, (undef51 = undef51) /\ (undef52 = (0 + undef51)) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52)) /\ (undef46 = undef46)>
<l7, l7, (undef60 = undef60) /\ (undef66 = __disjvr_1^0) /\ (__disjvr_1^0 = undef66) /\ (0 <= (~(1) + x_10^0)), par{__disjvr_1^0 -> undef66, x_10^0 -> (1 + x_10^0)}>

Fresh variables:
undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 

Undef variables:
undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, 1 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
Variables:
__disjvr_1^0, x_10^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>

Graph 2
<l0, l4, undef5 = undef8 /\ undef96 = undef97 /\ undef97 = 0, {x_10^0 -> undef8, rest remain the same}>
<l7, l4, undef51 = undef52 /\ undef52 = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000604s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001838s
[2214 : 2215]
[2214 : 2216]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014701s
Time used: 0.014698

LOG: SAT solveNonLinear - Elapsed time: 0.021477s
Cost: 1; Total time: 0.021071
Quasi-ranking function: 50000 - x_10^0
New Graphs: 
Transitions:
<l7, l7, 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
Variables:
__disjvr_1^0, x_10^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000516s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001794s
[2214 : 2220]
[2214 : 2221]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015113s
Time used: 0.01511

LOG: SAT solveNonLinear - Elapsed time: 0.021710s
Cost: 1; Total time: 0.021304
Quasi-ranking function: 50000 + __disjvr_1^0 - x_10^0
New Graphs: 
Transitions:
<l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
Variables:
__disjvr_1^0, x_10^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000632s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002394s
[2214 : 2225]
[2214 : 2226]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016589s
Time used: 0.016587

LOG: SAT solveNonLinear - Elapsed time: 0.024349s
Cost: 1; Total time: 0.023875
Quasi-ranking function: 50000 - __disjvr_1^0 - x_10^0
New Graphs: 
Transitions:
<l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= __disjvr_1^0 + x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
Variables:
__disjvr_1^0, x_10^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000709s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002723s
[2214 : 2232]
[2214 : 2233]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008942s
Time used: 0.008549
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[2214 : 2238]
[2214 : 2242]
Successful child: 2238

Program does NOT terminate