crypto/rsa/rsa_sp800_56b_check.c:179: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 16 steps of the trace


crypto/rsa/rsa_sp800_56b_check.c:175:15: Call
173.       ret = (gcd != NULL
174.             /* LCM(p - 1, q - 1) */
175.             && (rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1, p1q1) == 1)
                     ^
176.             /* (Step 6a) d < LCM(p - 1, q - 1) */
177.             && (BN_cmp(rsa->d, lcm) < 0)

crypto/rsa/rsa_sp800_56b_check.c:220:1: Parameter `ctx->pool.used`
  218.   
  219.   /* return LCM(p-1, q-1) */
  220. > int rsa_get_lcm(BN_CTX *ctx, const BIGNUM *p, const BIGNUM *q,
  221.                   BIGNUM *lcm, BIGNUM *gcd, BIGNUM *p1, BIGNUM *q1,
  222.                   BIGNUM *p1q1)

crypto/rsa/rsa_sp800_56b_check.c:179:14: Call
177.             && (BN_cmp(rsa->d, lcm) < 0)
178.             /* (Step 6b) 1 = (e . d) mod LCM(p - 1, q - 1) */
179.             && BN_mod_mul(r, rsa->e, rsa->d, lcm, ctx)
                    ^
180.             && BN_is_one(r));
181.   

crypto/bn/bn_mod.c:193:1: Parameter `ctx->pool.used`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/bn/bn_mod.c:204:14: Call
  202.   
  203.       BN_CTX_start(ctx);
  204.       if ((t = BN_CTX_get(ctx)) == NULL)
                      ^
  205.           goto err;
  206.       if (a == b) {

crypto/bn/bn_ctx.c:202:1: Parameter `ctx->pool.used`
    200.   }
    201.   
    202. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
    203.   {
    204.       BIGNUM *ret;

crypto/bn/bn_mod.c:210:14: Call
  208.               goto err;
  209.       } else {
  210.           if (!BN_mul(t, a, b, ctx))
                      ^
  211.               goto err;
  212.       }

crypto/bn/bn_mul.c:497:1: Parameter `ctx->pool.used`
    495.   #endif                          /* BN_RECURSION */
    496.   
    497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
    497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                         ^
    500.   
    501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `ctx->pool.used`
      505.   }
      506.   
      507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      508.   {
      509.       int ret = 0;

crypto/bn/bn_mul.c:618:5: Call
      616.    err:
      617.       bn_check_top(r);
      618.       BN_CTX_end(ctx);
                 ^
      619.       return ret;
      620.   }

crypto/bn/bn_ctx.c:185:1: Parameter `ctx->pool.used`
        183.   }
        184.   
        185. > void BN_CTX_end(BN_CTX *ctx)
        186.   {
        187.       CTXDBG("ENTER BN_CTX_end()", ctx);

crypto/bn/bn_ctx.c:194:13: Call
        192.           /* Does this stack frame have anything to release? */
        193.           if (fp < ctx->used)
        194.               BN_POOL_release(&ctx->pool, ctx->used - fp);
                           ^
        195.           ctx->used = fp;
        196.           /* Unjam "too_many" in case "get" had failed */

crypto/bn/bn_ctx.c:338:1: <LHS trace>
336.   }
337.   
338. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
339.   {
340.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:338:1: Parameter `p->used`
          336.   }
          337.   
          338. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
          339.   {
          340.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:340:5: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul` 
          338.   static void BN_POOL_release(BN_POOL *p, unsigned int num)
          339.   {
          340.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
                     ^
          341.   
          342.       p->used -= num;
