crypto/bn/bn_prime.c:433: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_rshift1`.
Showing all 14 steps of the trace


crypto/bn/bn_prime.c:425:10: Call
423.   
424.       /* we need ((rnd-rem) % add) == 0 */
425.       if (!BN_mod(t1, q, qadd, ctx))
                ^
426.           goto err;
427.       if (!BN_sub(q, q, t1))

crypto/bn/bn_div.c:209:1: Parameter `rm->top`
  207.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  208.    */
  209. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  210.              BN_CTX *ctx)
  211.   {

crypto/bn/bn_prime.c:433:14: Call
431.               goto err;
432.       } else {
433.           if (!BN_rshift1(t1, rem))
                    ^
434.               goto err;
435.           if (!BN_add(q, q, t1))

crypto/bn/bn_shift.c:47:1: Parameter `*r->d`
  45.   }
  46.   
  47. > int BN_rshift1(BIGNUM *r, const BIGNUM *a)
  48.   {
  49.       BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:63:13: Call
  61.       j = i - (ap[i - 1] == 1);
  62.       if (a != r) {
  63.           if (bn_wexpand(r, j) == NULL)
                    ^
  64.               return 0;
  65.           r->neg = a->neg;

crypto/bn/bn_lib.c:960:1: Parameter `*a->d`
    958.   }
    959.   
    960. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    961.   {
    962.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:962:37: Call
    960.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
    961.   {
    962.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                               ^
    963.   }
    964.   

crypto/bn/bn_lib.c:245:1: Parameter `*b->d`
      243.    */
      244.   
      245. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      246.   {
      247.       if (words > b->dmax) {

crypto/bn/bn_lib.c:248:23: Call
      246.   {
      247.       if (words > b->dmax) {
      248.           BN_ULONG *a = bn_expand_internal(b, words);
                                   ^
      249.           if (!a)
      250.               return NULL;

crypto/bn/bn_lib.c:209:1: <Offset trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `b->top`
        207.   /* This is used by bn_expand2() */
        208.   /* The caller MUST check that words > b->dmax before calling this */
        209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
        210.   {
        211.       BN_ULONG *a = NULL;

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

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

crypto/bn/bn_lib.c:232:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_rshift1` 
        230.       assert(b->top <= words);
        231.       if (b->top > 0)
        232.           memcpy(a, b->d, sizeof(*a) * b->top);
                       ^
        233.   
        234.       return a;
