Matrix generation: 71
Determinant computation: 20
Matrix generation: 0
Determinant computation: 10
Graph generation: 100
Negative clauses identification: 50
Matrix generation: 0
Determinant computation: 0
Clause removal: 140
Incremental addition of new clauses: 20
Negative clauses identfication: 30
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 10
Adding edges corresponding to no-exit-edge nodes: 6647
Total number of increments:476
Number of increments zero:256
Efficiency:0.46218487394957986
total running time:7098