crypto/rsa/rsa_ossl.c:852: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_add`.
Showing all 17 steps of the trace


crypto/rsa/rsa_ossl.c:845:10: Call
843.       }
844.   
845.       if (!BN_sub(r0, r0, m1))
                ^
846.           goto err;
847.       /*

crypto/bn/bn_add.c:233:1: Parameter `*r->d`
  231.   }
  232.   
  233. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  234.   {
  235.       int max;

crypto/bn/bn_add.c:274:9: Call
  272.   
  273.       max = (a->top > b->top) ? a->top : b->top;
  274.       if (bn_wexpand(r, max) == NULL)
                 ^
  275.           return (0);
  276.       if (BN_ucmp(a, b) < 0) {

crypto/bn/bn_lib.c:994:1: Parameter `*a->d`
    992.   }
    993.   
    994. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    995.   {
    996.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/rsa/rsa_ossl.c:852:14: Call
850.        */
851.       if (BN_is_negative(r0))
852.           if (!BN_add(r0, r0, rsa->p))
                    ^
853.               goto err;
854.   

crypto/bn/bn_add.c:62:1: Parameter `*r->d`
  60.   
  61.   /* r can == a or b */
  62. > int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  63.   {
  64.       const BIGNUM *tmp;

crypto/bn/bn_add.c:87:18: Call
  85.   
  86.           if (BN_ucmp(a, b) < 0) {
  87.               if (!BN_usub(r, b, a))
                         ^
  88.                   return (0);
  89.               r->neg = 1;

crypto/bn/bn_add.c:165:1: Parameter `*r->d`
    163.   
    164.   /* unsigned subtraction of b from a, a must be larger than b. */
    165. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    166.   {
    167.       int max, min, dif;

crypto/bn/bn_add.c:184:9: Call
    182.       }
    183.   
    184.       if (bn_wexpand(r, max) == NULL)
                   ^
    185.           return (0);
    186.   

crypto/bn/bn_lib.c:994:1: Parameter `*a->d`
      992.   }
      993.   
      994. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:996:37: Call
      994.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      997.   }
      998.   

crypto/bn/bn_lib.c:389:1: Parameter `*b->d`
        387.    */
        388.   
        389. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        390.   {
        391.       bn_check_top(b);

crypto/bn/bn_lib.c:394:23: Call
        392.   
        393.       if (words > b->dmax) {
        394.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        395.           if (!a)
        396.               return NULL;

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

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

crypto/bn/bn_lib.c:334:5: Assignment
          332.   
          333.   #if 1
          334.       B = b->d;
                     ^
          335.       /* Check if the previous number needs to be copied */
          336.       if (B != NULL) {

crypto/bn/bn_lib.c:351:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_add` 
          349.               a1 = B[1];
          350.               a2 = B[2];
          351.               a3 = B[3];
                                  ^
          352.               A[0] = a0;
          353.               A[1] = a1;
