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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, (undef13 = (0 + cnt_20^0)) /\ (undef14 = (0 + cnt_25^0)) /\ (((0 + (~(1) * undef13)) + undef14) <= 0) /\ (undef6 = undef6) /\ (undef7 = undef7) /\ (undef1 = undef1), par{Result_4^0 -> undef1, lt_11^0 -> undef6, lt_12^0 -> undef7}>
<l1, l3, (undef27 = (0 + cnt_20^0)) /\ (undef28 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef27)) + undef28)) /\ (undef20 = undef20) /\ (undef21 = undef21) /\ (undef24 = undef24) /\ ((0 + undef24) <= 0) /\ (0 <= (0 + undef24)), par{lt_11^0 -> undef20, lt_12^0 -> undef21, tmp_9^0 -> undef24}>
<l3, l1, true>
<l1, l4, (undef53 = (0 + cnt_20^0)) /\ (undef54 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef53)) + undef54)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef50 = undef50), par{lt_11^0 -> undef46, lt_12^0 -> undef47, tmp_9^0 -> undef50}>
<l4, l5, (undef56 = __disjvr_0^0) /\ (__disjvr_0^0 = undef56), par{__disjvr_0^0 -> undef56}>
<l5, l6, (undef79 = (0 + cnt_20^0)) /\ (undef71 = undef71), par{lt_10^0 -> undef71}>
<l6, l1, true>
<l7, l1, (undef103 = undef103) /\ (undef102 = undef102), par{p2_8^0 -> (0 + undef103), p_7^0 -> (0 + undef102), x_5^0 -> undef102, y_6^0 -> undef103}>
<l8, l7, true>

Fresh variables:
undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 

Undef variables:
undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (undef103 = undef103) /\ (undef102 = undef102)>
<l1, l2, (undef13 = (0 + cnt_20^0)) /\ (undef14 = (0 + cnt_25^0)) /\ (((0 + (~(1) * undef13)) + undef14) <= 0) /\ (undef6 = undef6) /\ (undef7 = undef7) /\ (undef1 = undef1)>
<l1, l1, (undef27 = (0 + cnt_20^0)) /\ (undef28 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef27)) + undef28)) /\ (undef20 = undef20) /\ (undef21 = undef21) /\ (undef24 = undef24) /\ ((0 + undef24) <= 0) /\ (0 <= (0 + undef24))>
<l1, l1, (undef53 = (0 + cnt_20^0)) /\ (undef54 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef53)) + undef54)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef50 = undef50) /\ (undef56 = __disjvr_0^0) /\ (__disjvr_0^0 = undef56) /\ (undef79 = (0 + cnt_20^0)) /\ (undef71 = undef71), par{__disjvr_0^0 -> undef56}>

Fresh variables:
undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 

Undef variables:
undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + undef27 <= undef28 /\ cnt_20^0 = undef27 /\ cnt_25^0 = undef28 /\ undef24 = 0, {all remain the same}>
<l1, l1, 1 + undef53 <= undef54 /\ __disjvr_0^0 = undef56 /\ cnt_20^0 = undef53 /\ cnt_20^0 = undef79 /\ cnt_25^0 = undef54, {__disjvr_0^0 -> undef56, rest remain the same}>
Variables:
cnt_20^0, cnt_25^0, __disjvr_0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l2, undef14 <= undef13 /\ cnt_20^0 = undef13 /\ cnt_25^0 = undef14, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000925s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002991s
[7842 : 7844]
[7842 : 7845]
Successful child: 7844
[ 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, 1 + undef27 <= undef28 /\ cnt_20^0 = undef27 /\ cnt_25^0 = undef28 /\ undef24 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + undef53 <= undef54 /\ __disjvr_0^0 = undef56 /\ cnt_20^0 = undef53 /\ cnt_20^0 = undef79 /\ cnt_25^0 = undef54, {__disjvr_0^0 -> undef56, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + undef53 <= undef54 /\ __disjvr_0^0 = undef56 /\ cnt_20^0 = undef53 /\ cnt_20^0 = undef79 /\ cnt_25^0 = undef54, {__disjvr_0^0 -> undef56, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + undef27 <= undef28 /\ cnt_20^0 = undef27 /\ cnt_25^0 = undef28 /\ undef24 = 0, {all remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000477s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: cnt_25^0 <= cnt_20^0 , 
Narrowing transition: 
<l1, l1, 1 + undef27 <= undef28 /\ cnt_20^0 = undef27 /\ cnt_25^0 = undef28 /\ undef24 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 1 + undef53 <= undef54 /\ __disjvr_0^0 = undef56 /\ cnt_20^0 = undef53 /\ cnt_20^0 = undef79 /\ cnt_25^0 = undef54, {__disjvr_0^0 -> undef56, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 + cnt_20^0 <= cnt_25^0 /\ 1 + undef27 <= undef28 /\ cnt_20^0 = undef27 /\ cnt_25^0 = undef28 /\ undef24 = 0, {all remain the same}>
<l1, l1, 1 + cnt_20^0 <= cnt_25^0 /\ 1 + undef53 <= undef54 /\ __disjvr_0^0 = undef56 /\ cnt_20^0 = undef53 /\ cnt_20^0 = undef79 /\ cnt_25^0 = undef54, {__disjvr_0^0 -> undef56, rest remain the same}>
Variables:
cnt_20^0, cnt_25^0, __disjvr_0^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000881s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003533s
[7842 : 7849]
[7842 : 7850]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012544s
Time used: 0.012002

[7842 : 7854]
[7842 : 7855]
Successful child: 7855

Program does NOT terminate