Matrix generation: 10
Determinant computation: 0
Matrix generation: 0
Determinant computation: 0
Graph generation: 50
Negative clauses identification: 60
Matrix generation: 0
Determinant computation: 10
Clause removal: 0
Incremental addition of new clauses: 10
Negative clauses identfication: 20
Detection of no-exit-edge nodes: 10
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 691
Total number of increments:234
Number of increments zero:191
Efficiency:0.18376068376068377
total running time:861