Flawfinder version 2.0.10, (C) 2001-2019 David A. Wheeler. Number of rules (primarily dangerous function names) in C/C++ ruleset: 223 Examining data/python-pot-0.7.0+dfsg/ot/lp/EMD.h Examining data/python-pot-0.7.0+dfsg/ot/lp/EMD_wrapper.cpp Examining data/python-pot-0.7.0+dfsg/ot/lp/core.h Examining data/python-pot-0.7.0+dfsg/ot/lp/full_bipartitegraph.h Examining data/python-pot-0.7.0+dfsg/ot/lp/network_simplex_simple.h FINAL RESULTS: data/python-pot-0.7.0+dfsg/ot/lp/network_simplex_simple.h:1431:21: [2] (buffer) char: Statically-sized arrays can be improperly restricted, leading to potential overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use functions that limit length, or ensure that the size is larger than the maximum possible length. char errMess[1000]; data/python-pot-0.7.0+dfsg/ot/lp/network_simplex_simple.h:1432:21: [2] (buffer) sprintf: Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or vsnprintf. Risk is low because the source has a constant maximum length. sprintf( errMess, "RESULT MIGHT BE INACURATE\nMax number of iteration reached, currently \%d. Sometimes iterations go on in cycle even though the solution has been reached, to check if it's the case here have a look at the minimal reduced cost. If it is very close to machine precision, you might actually have the correct solution, if not try setting the maximum number of iterations a bit higher\n",iter_number ); ANALYSIS SUMMARY: Hits = 2 Lines analyzed = 2015 in approximately 0.07 seconds (30661 lines/second) Physical Source Lines of Code (SLOC) = 1151 Hits@level = [0] 0 [1] 0 [2] 2 [3] 0 [4] 0 [5] 0 Hits@level+ = [0+] 2 [1+] 2 [2+] 2 [3+] 0 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 1.73762 [1+] 1.73762 [2+] 1.73762 [3+] 0 [4+] 0 [5+] 0 Dot directories skipped = 3 (--followdotdir overrides) Minimum risk level = 1 Not every hit is necessarily a security vulnerability. There may be other security vulnerabilities; review your code! See 'Secure Programming HOWTO' (https://dwheeler.com/secure-programs) for more information.