crypto/bn/bn_exp.c:774: error: INTEGER_OVERFLOW_L2
  (0 - [0, 1]):unsigned64 by call to `BN_mod_mul_montgomery`.
Showing all 15 steps of the trace


crypto/bn/bn_exp.c:774:8: Call
772.   	else
773.   #endif
774.    	if (!BN_to_montgomery(&tmp,BN_value_one(),mont,ctx))	goto err;
              ^
775.   
776.   	/* prepare a^1 in Montgomery domain */

crypto/bn/bn_lib.c:139:2: Assignment
  137.   const BIGNUM *BN_value_one(void)
  138.   	{
  139.   	static const BN_ULONG data_one=1L;
          ^
  140.   	static const BIGNUM const_one={(BN_ULONG *)&data_one,1,1,0,BN_FLG_STATIC_DATA};
  141.   

crypto/bn/bn_exp.c:774:8: Call
772.   	else
773.   #endif
774.    	if (!BN_to_montgomery(&tmp,BN_value_one(),mont,ctx))	goto err;
              ^
775.   
776.   	/* prepare a^1 in Montgomery domain */

crypto/bn/bn_mont.c:131:1: Parameter `*a->d`
  129.   #endif
  130.   
  131. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  132.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
  133.   	{

crypto/bn/bn_mont.c:163:8: Call
  161.   	else
  162.   		{
  163.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                ^
  164.   		}
  165.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:943:1: Parameter `*a->d`
    941.   #endif /* BN_RECURSION */
    942.   
    943. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    944.   	{
    945.   	int ret=0;

crypto/bn/bn_mul.c:1032:5: Call
    1030.   				if (bn_wexpand(t,k*4) == NULL) goto err;
    1031.   				if (bn_wexpand(rr,k*4) == NULL) goto err;
    1032.   				bn_mul_part_recursive(rr->d,a->d,b->d,
                ^
    1033.   					j,al-j,bl-j,t->d);
    1034.   				}

crypto/bn/bn_mul.c:550:1: Parameter `*a`
      548.    * t needs to be n*4 is size, as does r */
      549.   /* tnX may not be negative but less than n */
      550. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      551.   	     int tna, int tnb, BN_ULONG *t)
      552.   	{

crypto/bn/bn_mul.c:568:5: Call
      566.   
      567.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
      568.   	c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
                 ^
      569.   	c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
      570.   	neg=0;

crypto/bn/bn_lib.c:807:1: Parameter `*b`
        805.      All lengths are the number of BN_ULONGs...  */
        806.   
        807. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
        808.   	int cl, int dl)
        809.   	{

crypto/bn/bn_mul.c:574:3: Call
      572.   		{
      573.   	case -4:
      574.   		bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
               ^
      575.   		bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
      576.   		break;

crypto/bn/bn_mul.c:80:1: <RHS trace>
78.      assembler counterparts for the systems that use assembler files.  */
79.   
80. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
81.   	const BN_ULONG *a, const BN_ULONG *b,
82.   	int cl, int dl)

crypto/bn/bn_mul.c:80:1: Parameter `*b`
        78.      assembler counterparts for the systems that use assembler files.  */
        79.   
        80. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
        81.   	const BN_ULONG *a, const BN_ULONG *b,
        82.   	int cl, int dl)

crypto/bn/bn_mul.c:103:4: Assignment
        101.   		for (;;)
        102.   			{
        103.   			t = b[0];
                  ^
        104.   			r[0] = (0-t-c)&BN_MASK2;
        105.   			if (t != 0) c=1;

crypto/bn/bn_mul.c:104:4: Binary operation: (0 - [0, 1]):unsigned64 by call to `BN_mod_mul_montgomery` 
        102.   			{
        103.   			t = b[0];
        104.   			r[0] = (0-t-c)&BN_MASK2;
                  ^
        105.   			if (t != 0) c=1;
        106.   			if (++dl >= 0) break;
