crypto/bn/bn_print.c:143: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div_word`.
Showing all 16 steps of the trace


crypto/bn/bn_print.c:128:14: Call
126.           goto err;
127.       }
128.       if ((t = BN_dup(a)) == NULL)
                    ^
129.           goto err;
130.   

crypto/bn/bn_lib.c:421:10: Call
  419.       if (t == NULL)
  420.           return NULL;
  421.       if (!BN_copy(t, a)) {
                  ^
  422.           BN_free(t);
  423.           return NULL;

crypto/bn/bn_lib.c:429:1: Parameter `*a->d`
    427.   }
    428.   
    429. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    430.   {
    431.       int i;

crypto/bn/bn_print.c:143:19: Call
141.           i = 0;
142.           while (!BN_is_zero(t)) {
143.               *lp = BN_div_word(t, BN_DEC_CONV);
                         ^
144.               lp++;
145.           }

crypto/bn/bn_word.c:88:1: Parameter `*a->d`
  86.   }
  87.   
  88. > BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
  89.   {
  90.       BN_ULONG ret = 0;

crypto/bn/bn_word.c:105:10: Call
  103.       j = BN_BITS2 - BN_num_bits_word(w);
  104.       w <<= j;
  105.       if (!BN_lshift(a, a, j))
                  ^
  106.           return (BN_ULONG)-1;
  107.   

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
    128.   }
    129.   
    130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    131.   {
    132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
    144.       r->neg = a->neg;
    145.       nw = n / BN_BITS2;
    146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                   ^
    147.           return (0);
    148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
      993.   }
      994.   
      995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:997:37: Call
      995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      998.   }
      999.   

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
        388.    */
        389.   
        390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        391.   {
        392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
        393.   
        394.       if (words > b->dmax) {
        395.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        396.           if (!a)
        397.               return NULL;

crypto/bn/bn_lib.c:300:1: <Length trace>
298.   /* This is used by bn_expand2() */
299.   /* The caller MUST check that words > b->dmax before calling this */
300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
301.   {
302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:300:1: Parameter `*b->d`
          298.   /* This is used by bn_expand2() */
          299.   /* The caller MUST check that words > b->dmax before calling this */
          300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          301.   {
          302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:335:5: Assignment
          333.   
          334.   #if 1
          335.       B = b->d;
                     ^
          336.       /* Check if the previous number needs to be copied */
          337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div_word` 
          350.               a1 = B[1];
          351.               a2 = B[2];
          352.               a3 = B[3];
                                  ^
          353.               A[0] = a0;
          354.               A[1] = a1;
