/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, (undef2 = undef2) /\ (undef5 = (0 + undef2)), par{nondet_7^0 -> undef2, temp6_11^0 -> undef5, x_10^0 -> (0 + undef5)}>
<l3, l4, (undef9 = undef9) /\ (undef10 = (0 + undef9)) /\ ((0 + undef10) <= 0) /\ (0 <= (0 + undef10)) /\ (undef7 = undef7), par{Result_6^0 -> undef7, nondet_8^0 -> undef9, temp5_9^0 -> undef10}>
<l3, l5, (undef15 = undef15), par{nondet_8^0 -> undef15, temp5_9^0 -> (0 + undef15)}>
<l5, l6, ((1 + temp5_9^0) <= 0)>
<l5, l6, (1 <= (0 + temp5_9^0))>
<l6, l7, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l7, l4, (undef39 = undef39) /\ (undef40 = (0 + undef39)) /\ ((0 + undef40) <= 0) /\ (0 <= (0 + undef40)) /\ (undef37 = undef37), par{Result_6^0 -> undef37, nondet_8^0 -> undef39, temp5_9^0 -> undef40}>
<l7, l8, (undef45 = undef45), par{nondet_8^0 -> undef45, temp5_9^0 -> (0 + undef45)}>
<l8, l9, ((1 + temp5_9^0) <= 0)>
<l8, l9, (1 <= (0 + temp5_9^0))>
<l9, l10, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l10, l7, true>
<l2, l4, (undef75 = undef75) /\ (undef76 = (0 + undef75)) /\ ((0 + undef76) <= 0) /\ (0 <= (0 + undef76)) /\ (undef73 = undef73), par{Result_6^0 -> undef73, nondet_8^0 -> undef75, temp5_9^0 -> undef76}>
<l2, l11, (undef81 = undef81), par{nondet_8^0 -> undef81, temp5_9^0 -> (0 + undef81)}>
<l11, l12, ((1 + temp5_9^0) <= 0)>
<l11, l12, (1 <= (0 + temp5_9^0))>
<l12, l7, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l13, l1, true>

Fresh variables:
undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, 

Undef variables:
undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef2 = undef2) /\ (undef5 = (0 + undef2)) /\ (undef75 = undef75) /\ (undef76 = (0 + undef75)) /\ ((0 + undef76) <= 0) /\ (0 <= (0 + undef76)) /\ (undef73 = undef73), par{x_10^0 -> (0 + undef5)}>
<l0, l7, (undef2 = undef2) /\ (undef5 = (0 + undef2)) /\ (undef81 = undef81) /\ ((1 + (0 + undef81)) <= 0) /\ (0 <= (~(1) + (0 + undef5))), par{x_10^0 -> (1 + (0 + undef5))}>
<l0, l7, (undef2 = undef2) /\ (undef5 = (0 + undef2)) /\ (undef81 = undef81) /\ (1 <= (0 + (0 + undef81))) /\ (0 <= (~(1) + (0 + undef5))), par{x_10^0 -> (1 + (0 + undef5))}>
<l7, l4, (undef39 = undef39) /\ (undef40 = (0 + undef39)) /\ ((0 + undef40) <= 0) /\ (0 <= (0 + undef40)) /\ (undef37 = undef37)>
<l7, l7, (undef45 = undef45) /\ ((1 + (0 + undef45)) <= 0) /\ (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
<l7, l7, (undef45 = undef45) /\ (1 <= (0 + (0 + undef45))) /\ (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>

Fresh variables:
undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, 

Undef variables:
undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, 

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 /\ 1 + undef45 <= 0, {x_10^0 -> 1 + x_10^0, rest remain the same}>
<l7, l7, 1 <= x_10^0 /\ 1 <= undef45, {x_10^0 -> 1 + x_10^0, rest remain the same}>
Variables:
x_10^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l0, l4, undef2 = undef5 /\ undef75 = undef76 /\ undef76 = 0, {x_10^0 -> undef5, rest remain the same}>
<l7, l4, undef39 = undef40 /\ undef40 = 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.003289

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000811s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003470s
[65373 : 65374]
[65373 : 65375]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034802s
Time used: 0.034794

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 <= x_10^0 /\ 1 + undef45 <= 0, {x_10^0 -> 1 + x_10^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 <= x_10^0 /\ 1 <= undef45, {x_10^0 -> 1 + x_10^0, 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): 
<l7, l7, 1 <= x_10^0 /\ 1 + undef45 <= 0, {x_10^0 -> 1 + x_10^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000783s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003552s
[65373 : 65379]
[65373 : 65380]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

[65373 : 65492]
[65373 : 65496]
Successful child: 65492

Program does NOT terminate