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


crypto/bn/bn_blind.c:255:14: Call
253.           if (!BN_priv_rand_range(ret->A, ret->mod))
254.               goto err;
255.           if (!int_bn_mod_inverse(ret->Ai, ret->A, ret->mod, ctx, &rv)) {
                    ^
256.               /*
257.                * this should almost never happen for good RSA keys

crypto/bn/bn_gcd.c:135:1: Parameter `in->top`
  133.   }
  134.   
  135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
  136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
  137.                              int *pnoinv)

crypto/bn/bn_blind.c:255:14: Call
253.           if (!BN_priv_rand_range(ret->A, ret->mod))
254.               goto err;
255.           if (!int_bn_mod_inverse(ret->Ai, ret->A, ret->mod, ctx, &rv)) {
                    ^
256.               /*
257.                * this should almost never happen for good RSA keys

crypto/bn/bn_gcd.c:135:1: Parameter `n->top`
  133.   }
  134.   
  135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
  136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
  137.                              int *pnoinv)

crypto/bn/bn_gcd.c:148:16: Call
  146.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
  147.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
  148.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                        ^
  149.       }
  150.   

crypto/bn/bn_gcd.c:451:1: Parameter `n->top`
    449.    * not contain branches that may leak sensitive information.
    450.    */
    451. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
    452.                                           const BIGNUM *a, const BIGNUM *n,
    453.                                           BN_CTX *ctx)

crypto/bn/bn_gcd.c:484:9: Call
    482.       if (BN_copy(B, a) == NULL)
    483.           goto err;
    484.       if (BN_copy(A, n) == NULL)
                   ^
    485.           goto err;
    486.       A->neg = 0;

crypto/bn/bn_lib.c:285:1: <Offset trace>
283.   }
284.   
285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
286.   {
287.       bn_check_top(b);

crypto/bn/bn_lib.c:285:1: Parameter `b->top`
      283.   }
      284.   
      285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      286.   {
      287.       bn_check_top(b);

crypto/bn/bn_lib.c:285:1: <Length trace>
283.   }
284.   
285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
286.   {
287.       bn_check_top(b);

crypto/bn/bn_lib.c:285:1: Parameter `*a->d`
      283.   }
      284.   
      285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      286.   {
      287.       bn_check_top(b);

crypto/bn/bn_lib.c:291:9: Call
      289.       if (a == b)
      290.           return a;
      291.       if (bn_wexpand(a, b->top) == NULL)
                     ^
      292.           return NULL;
      293.   

crypto/bn/bn_lib.c:910:1: Parameter `*a->d`
        908.   }
        909.   
        910. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        911.   {
        912.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:295:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `int_bn_mod_inverse` 
      293.   
      294.       if (b->top > 0)
      295.           memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);
                     ^
      296.   
      297.       a->top = b->top;
