{"push_id":649262301,"size":1,"distinct_size":1,"ref":"refs/heads/trunk","head":"8e58c5ebeed35bd76a2126e6336a021f6c2cb23e","before":"aa551499f7dc97894123b387c141ee038de81e78","commits":[{"sha":"8e58c5ebeed35bd76a2126e6336a021f6c2cb23e","author":{"email":"1570f45fd579a26bc2a3b1541514affddbabb8c9@4712c6d2-40bb-43ae-aa4b-fec3f1bdfe4c","name":"dangl"},"message":"The bounds CPA now also restricts the number of repeated function exits in the context of recursion. This is required for k-induction, where there is a wildcard callstack state that might otherwise lead to an infinite amount of repeated function exits.\n\ngit-svn-id: https://svn.sosy-lab.org/software/cpachecker/trunk@16773 4712c6d2-40bb-43ae-aa4b-fec3f1bdfe4c","distinct":true,"url":"https://api.github.com/repos/dbeyer/cpachecker/commits/8e58c5ebeed35bd76a2126e6336a021f6c2cb23e"}]}