Matrix generation: 0
Determinant computation: 0
Matrix generation: 0
Determinant computation: 0
Graph generation: 20
Negative clauses identification: 10
Matrix generation: 0
Determinant computation: 0
Clause removal: 0
Incremental addition of new clauses: 30
Negative clauses identfication: 10
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 500
Total number of increments:177
Number of increments zero:117
Efficiency:0.3389830508474576
total running time:570