crypto/dh/dh_key.c:106: error: BUFFER_OVERRUN_L3
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_exp_mont`.
Showing all 12 steps of the trace


crypto/dh/dh_key.c:65:1: Parameter `dh->method_mont_p->RR.d`
63.   #include "dh.h"
64.   
65. > int DH_generate_key(DH *dh)
66.   	{
67.   	int ok=0;

crypto/dh/dh_key.c:106:7: Call
104.   	mont=(BN_MONT_CTX *)dh->method_mont_p;
105.   
106.   	if (!BN_mod_exp_mont(pub_key,dh->g,priv_key,dh->p,&ctx,mont)) goto err;
             ^
107.   		
108.   	dh->pub_key=pub_key;

crypto/bn/bn_exp.c:299:1: Parameter `*in_mont->RR.d`
  297.   
  298.   /* #ifdef MONT_MUL_MOD */
  299. > int BN_mod_exp_mont(BIGNUM *rr, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx,
  300.   	     BN_MONT_CTX *in_mont)
  301.   	{

crypto/bn/bn_exp.c:348:7: Call
  346.   	else
  347.   		aa=a;
  348.   	if (!BN_to_montgomery(&(val[0]),aa,mont,ctx)) goto err; /* 1 */
               ^
  349.   	if (!BN_mod_mul_montgomery(d,&(val[0]),&(val[0]),mont,ctx)) goto err; /* 2 */
  350.   

crypto/bn/bn_mont.c:71:1: Parameter `*b->d`
    69.   #define MONT_WORD
    70.   
    71. > int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_MONT_CTX *mont,
    72.   	     BN_CTX *ctx)
    73.   	{

crypto/bn/bn_mont.c:98:8: Call
    96.   	else
    97.   		{
    98.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                  ^
    99.   		}
    100.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:560:1: Parameter `*b->d`
      558.   #endif
      559.   
      560. > int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
      561.   	{
      562.   	int top,al,bl;

crypto/bn/bn_mul.c:640:4: Call
      638.   		if ((i ==  1) && !BN_get_flags(b,BN_FLG_STATIC_DATA))
      639.   			{
      640.   			bn_wexpand(b,al);
                ^
      641.   			b->d[bl]=0;
      642.   			bl++;

crypto/bn/bn_lib.c:344:1: <Length trace>
342.   	}
343.   
344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
345.   	{
346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:344:1: Parameter `*b->d`
        342.   	}
        343.   
        344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        345.   	{
        346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:367:3: Assignment
        365.   memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
        366.   #if 1
        367.   		B=b->d;
                 ^
        368.   		/* Check if the previous number needs to be copied */
        369.   		if (B != NULL)

crypto/bn/bn_lib.c:377:43: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_exp_mont` 
        375.   				{
        376.   				A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
        377.   				A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
                                                         ^
        378.   				A+=8;
        379.   				B+=8;
