crypto/asn1/a_object.c:131: error: BUFFER_OVERRUN_L3
  Offset added: [0, 512] Size: [0, 536870848] by call to `BN_div_word`.
Showing all 16 steps of the trace


crypto/asn1/a_object.c:95:36: Call
93.                   if (bl == NULL)
94.                       bl = BN_new();
95.                   if (bl == NULL || !BN_set_word(bl, l))
                                         ^
96.                       goto err;
97.               }

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
  461.   }
  462.   
  463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  464.   {
  465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
  464.   {
  465.       bn_check_top(a);
  466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                 ^
  467.           return (0);
  468.       a->neg = 0;

crypto/bn/bn_lcl.h:676:1: Parameter `*a->d`
    674.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
    675.   
    676. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
    677.   {
    678.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/asn1/a_object.c:131:43: Call
129.               }
130.               while (blsize--)
131.                   tmp[i++] = (unsigned char)BN_div_word(bl, 0x80L);
                                                 ^
132.           } else {
133.   

crypto/bn/bn_word.c:39:1: Parameter `*a->d`
  37.   }
  38.   
  39. > BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
  40.   {
  41.       BN_ULONG ret = 0;

crypto/bn/bn_word.c:56:10: Call
  54.       j = BN_BITS2 - BN_num_bits_word(w);
  55.       w <<= j;
  56.       if (!BN_lshift(a, a, j))
                 ^
  57.           return (BN_ULONG)-1;
  58.   

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
    79.   }
    80.   
    81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    82.   {
    83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:5: Assignment
    94.   
    95.       r->neg = a->neg;
    96.       nw = n / BN_BITS2;
              ^
    97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
    98.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
    79.   }
    80.   
    81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    82.   {
    83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
    95.       r->neg = a->neg;
    96.       nw = n / BN_BITS2;
    97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                   ^
    98.           return (0);
    99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1014:1: Parameter `*a->d`
      1012.   }
      1013.   
      1014. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1015.   {
      1016.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
    100.       rb = BN_BITS2 - lb;
    101.       f = a->d;
    102.       t = r->d;
               ^
    103.       t[a->top + nw] = 0;
    104.       if (lb == 0)

crypto/bn/bn_shift.c:113:5: Array access: Offset added: [0, 512] Size: [0, 536870848] by call to `BN_div_word` 
    111.               t[nw + i] = (l << lb) & BN_MASK2;
    112.           }
    113.       memset(t, 0, sizeof(*t) * nw);
               ^
    114.       r->top = a->top + nw + 1;
    115.       bn_correct_top(r);
