crypto/sm2/sm2_sign.c:121: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_inverse`.
Showing all 17 steps of the trace


crypto/sm2/sm2_sign.c:120:9: Call
118.               continue;
119.   
120.           BN_add(s, dA, BN_value_one());
               ^
121.           BN_mod_inverse(s, s, order, ctx);
122.   

crypto/bn/bn_add.c:40:18: Call
  38.   
  39.           if (BN_ucmp(a, b) < 0) {
  40.               if (!BN_usub(r, b, a))
                         ^
  41.                   return 0;
  42.               r->neg = 1;

crypto/bn/bn_add.c:107:1: Parameter `r->top`
    105.   
    106.   /* unsigned subtraction of b from a, a must be larger than b. */
    107. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    108.   {
    109.       int max, min, dif;

crypto/sm2/sm2_sign.c:121:9: Call
119.   
120.           BN_add(s, dA, BN_value_one());
121.           BN_mod_inverse(s, s, order, ctx);
               ^
122.   
123.           BN_mod_mul(tmp, dA, r, order, ctx);

crypto/bn/bn_gcd.c:124:1: Parameter `a->top`
  122.                                           BN_CTX *ctx);
  123.   
  124. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  125.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  126.   {

crypto/bn/bn_gcd.c:129:10: Call
  127.       BIGNUM *rv;
  128.       int noinv;
  129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                  ^
  130.       if (noinv)
  131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `a->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 `a->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:482:9: Call
      480.       BN_one(X);
      481.       BN_zero(Y);
      482.       if (BN_copy(B, a) == NULL)
                     ^
      483.           goto err;
      484.       if (BN_copy(A, n) == NULL)

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 `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;
