crypto/bn/bn_blind.c:256: 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:254:14: Call
252.       do {
253.           int rv;
254.           if (!BN_rand_range(ret->A, ret->mod))
                    ^
255.               goto err;
256.           if (!int_bn_mod_inverse(ret->Ai, ret->A, ret->mod, ctx, &rv)) {

crypto/bn/bn_rand.c:107:1: Parameter `range->top`
  105.   
  106.   /* random number r:  0 <= r < range */
  107. > int BN_rand_range(BIGNUM *r, const BIGNUM *range)
  108.   {
  109.       int n;

crypto/bn/bn_blind.c:256:14: Call
254.           if (!BN_rand_range(ret->A, ret->mod))
255.               goto err;
256.           if (!int_bn_mod_inverse(ret->Ai, ret->A, ret->mod, ctx, &rv)) {
                    ^
257.               /*
258.                * 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:323:1: <Offset trace>
321.   }
322.   
323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
324.   {
325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: Parameter `b->top`
      321.   }
      322.   
      323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: <Length trace>
321.   }
322.   
323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
324.   {
325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: Parameter `*a->d`
      321.   }
      322.   
      323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:329:9: Call
      327.       if (a == b)
      328.           return a;
      329.       if (bn_wexpand(a, b->top) == NULL)
                     ^
      330.           return NULL;
      331.   

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
        946.   }
        947.   
        948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        949.   {
        950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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