About the Execution of ITS-Tools for TokenRing-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13294.136 | 1058509.00 | 1212188.00 | 3052.50 | TFTTFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r422-smll-171690573700162.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is TokenRing-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r422-smll-171690573700162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 519K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-00
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-01
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-02
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-03
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-04
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-05
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-06
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-07
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-08
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-09
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-10
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-11
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-12
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-13
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-14
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717005067005
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 17:51:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:51:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:51:10] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2024-05-29 17:51:10] [INFO ] Transformed 121 places.
[2024-05-29 17:51:10] [INFO ] Transformed 1111 transitions.
[2024-05-29 17:51:10] [INFO ] Found NUPN structural information;
[2024-05-29 17:51:10] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 223 ms.
Support contains 121 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 29 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-05-29 17:51:12] [INFO ] Computed 11 invariants in 36 ms
[2024-05-29 17:51:12] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-29 17:51:12] [INFO ] Invariant cache hit.
[2024-05-29 17:51:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:51:13] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:51:13] [INFO ] Invariant cache hit.
[2024-05-29 17:51:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:21] [INFO ] Deduced a trap composed of 66 places in 356 ms of which 33 ms to minimize.
[2024-05-29 17:51:22] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:51:22] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:51:22] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:51:22] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:51:23] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:51:23] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:51:23] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:51:23] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:51:24] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 5 ms to minimize.
[2024-05-29 17:51:24] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:51:24] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 2 ms to minimize.
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:51:30] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:51:30] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:51:30] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:51:30] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:51:40] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 2 ms to minimize.
[2024-05-29 17:51:40] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:51:40] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:51:40] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:51:41] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:51:41] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:51:41] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:51:41] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:51:42] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:51:42] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:51:42] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:51:42] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:51:43] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:51:43] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:51:43] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 4 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30093 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 3 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 2 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:51:51] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:51:51] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:51:51] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:51:51] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:51:52] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:51:52] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 ms to minimize.
[2024-05-29 17:51:52] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:51:52] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:51:53] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:54] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 2 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 64 places in 218 ms of which 2 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:51:58] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 3 ms to minimize.
[2024-05-29 17:51:58] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:51:58] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:51:58] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:51:59] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:51:59] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:51:59] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2024-05-29 17:51:59] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:52:02] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:52:02] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:52:02] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:52:05] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 3 ms to minimize.
[2024-05-29 17:52:05] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:52:05] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:52:05] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:52:06] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:52:06] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:52:06] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:52:06] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:52:07] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:52:07] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:52:13] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:52:13] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:52:13] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 3 ms to minimize.
[2024-05-29 17:52:13] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:52:14] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:52:14] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:52:14] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 2 ms to minimize.
[2024-05-29 17:52:14] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:52:15] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 2 ms to minimize.
[2024-05-29 17:52:15] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 2 ms to minimize.
SMT process timed out in 61491ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61545ms
Finished structural reductions in LTL mode , in 1 iterations and 62890 ms. Remains : 121/121 places, 1111/1111 transitions.
Support contains 121 out of 121 places after structural reductions.
[2024-05-29 17:52:16] [INFO ] Flatten gal took : 380 ms
[2024-05-29 17:52:19] [INFO ] Flatten gal took : 500 ms
[2024-05-29 17:52:22] [INFO ] Input system was already deterministic with 1111 transitions.
Reduction of identical properties reduced properties to check from 63 to 55
RANDOM walk for 40000 steps (8 resets) in 10911 ms. (3 steps per ms) remains 36/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 2245 ms. (1 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 1167 ms. (3 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 1126 ms. (3 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 1741 ms. (2 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 499 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 527 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 485 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 480 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 512 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 462 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 508 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 470 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 506 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 395 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 405 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 486 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 569 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 578 ms. (6 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 512 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 524 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 457 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 459 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 407 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 435 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 390 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 384 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 385 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 393 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 417 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 378 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 403 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 408 ms. (9 steps per ms) remains 32/32 properties
[2024-05-29 17:52:31] [INFO ] Invariant cache hit.
[2024-05-29 17:52:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-05-29 17:52:42] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 2 ms to minimize.
[2024-05-29 17:52:42] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-05-29 17:52:43] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:52:43] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 2 ms to minimize.
[2024-05-29 17:52:43] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 5/137 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 2 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 2 ms to minimize.
[2024-05-29 17:52:46] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 11/148 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 148 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5017 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 31/28 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 16/148 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-05-29 17:52:47] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 2 ms to minimize.
[2024-05-29 17:52:47] [INFO ] Deduced a trap composed of 63 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:52:48] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:52:48] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:52:48] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:52:49] [INFO ] Deduced a trap composed of 71 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:52:49] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:52:49] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:52:50] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:52:50] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:52:50] [INFO ] Deduced a trap composed of 67 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:52:51] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:52:51] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:52:51] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:52:51] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 163 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5007 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 3/28 constraints, Known Traps: 31/31 constraints]
After SMT, in 20513ms problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 48 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 40000 steps (8 resets) in 7378 ms. (5 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 919 ms. (4 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 680 ms. (5 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 615 ms. (6 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 990 ms. (4 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 374 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 430 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 407 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 344 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 346 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 452 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 447 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 448 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 458 ms. (8 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 337 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 340 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 340 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 329 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 320 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 432 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 418 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 405 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 414 ms. (9 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 367 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 367 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 347 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 328 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 315 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 323 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 287 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 290 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 260 ms. (15 steps per ms) remains 31/31 properties
Probably explored full state space saw : 58904 states, properties seen :0
Probabilistic random walk after 352949 steps, saw 58904 distinct states, run finished after 6033 ms. (steps per millisecond=58 ) properties seen :0
Explored full state space saw : 58905 states, properties seen :0
Exhaustive walk after 352955 steps, saw 58905 distinct states, run finished after 6301 ms. (steps per millisecond=56 ) properties seen :0
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
FORMULA TokenRing-PT-010-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 17:53:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 17:53:11] [INFO ] Flatten gal took : 172 ms
[2024-05-29 17:53:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TokenRing-PT-010-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 17:53:12] [INFO ] Flatten gal took : 197 ms
[2024-05-29 17:53:13] [INFO ] Input system was already deterministic with 1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:53:14] [INFO ] Invariant cache hit.
[2024-05-29 17:53:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 17:53:14] [INFO ] Invariant cache hit.
[2024-05-29 17:53:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:53:14] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:53:14] [INFO ] Invariant cache hit.
[2024-05-29 17:53:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:53:22] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 2 ms to minimize.
[2024-05-29 17:53:22] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 2 ms to minimize.
[2024-05-29 17:53:23] [INFO ] Deduced a trap composed of 66 places in 301 ms of which 22 ms to minimize.
[2024-05-29 17:53:23] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:53:23] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 3 ms to minimize.
[2024-05-29 17:53:23] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:53:24] [INFO ] Deduced a trap composed of 66 places in 299 ms of which 3 ms to minimize.
[2024-05-29 17:53:24] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 3 ms to minimize.
[2024-05-29 17:53:24] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:53:25] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 2 ms to minimize.
[2024-05-29 17:53:25] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 1 ms to minimize.
[2024-05-29 17:53:25] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:53:25] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:53:25] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:53:26] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:53:26] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:53:26] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:53:27] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:53:27] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:53:27] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:53:28] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:53:29] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:53:29] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:53:29] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:53:29] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:53:30] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 2 ms to minimize.
[2024-05-29 17:53:30] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:53:30] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:53:30] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:53:31] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:53:31] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:53:31] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:53:32] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:53:32] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:53:32] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:53:32] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:53:33] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:53:33] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:53:33] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:53:34] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:53:41] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:53:42] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:53:42] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:53:42] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:53:42] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 5 ms to minimize.
[2024-05-29 17:53:43] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:53:43] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 3 ms to minimize.
[2024-05-29 17:53:43] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 3 ms to minimize.
[2024-05-29 17:53:43] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:53:44] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:53:44] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:53:44] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:53:45] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 4 ms to minimize.
[2024-05-29 17:53:45] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:53:45] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:53:45] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:53:46] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:53:46] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
SMT process timed out in 31492ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31520ms
Finished structural reductions in LTL mode , in 1 iterations and 32078 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:53:46] [INFO ] Flatten gal took : 67 ms
[2024-05-29 17:53:46] [INFO ] Flatten gal took : 88 ms
[2024-05-29 17:53:46] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:53:47] [INFO ] Flatten gal took : 91 ms
[2024-05-29 17:53:47] [INFO ] Flatten gal took : 79 ms
[2024-05-29 17:53:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12870078541276433424.gal : 30 ms
[2024-05-29 17:53:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13133212542501405534.ctl : 46 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12870078541276433424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13133212542501405534.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.08759,46600,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(!(A(((((((((((((AF(((((((State_10_7==1)&&(State_0_7==1))||((State_0_2==1)&&(State_10_2==1)))||(((State_10_1==1)&&(State_0_1==1))||((St...80684
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),!(!(E(TRUE U !(!(((((((State_10_7==1)&&(State_0_7==1))||((State_0_2==1)&&(State_10_2==1))...81630
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
Detected timeout of ITS tools.
[2024-05-29 17:54:17] [INFO ] Flatten gal took : 78 ms
[2024-05-29 17:54:17] [INFO ] Applying decomposition
[2024-05-29 17:54:17] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3013842877693260542.txt' '-o' '/tmp/graph3013842877693260542.bin' '-w' '/tmp/graph3013842877693260542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3013842877693260542.bin' '-l' '-1' '-v' '-w' '/tmp/graph3013842877693260542.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:54:17] [INFO ] Decomposing Gal with order
[2024-05-29 17:54:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:54:18] [INFO ] Removed a total of 2340 redundant transitions.
[2024-05-29 17:54:18] [INFO ] Flatten gal took : 300 ms
[2024-05-29 17:54:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 33 ms.
[2024-05-29 17:54:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10524401755710633470.gal : 16 ms
[2024-05-29 17:54:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8062773700192854638.ctl : 29 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10524401755710633470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8062773700192854638.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,1.07576,33648,2453,14,48098,186,1519,82921,17,479,0
Converting to forward existential form...Done !
original formula: EX(!(A(((((((((((((AF(((((((i0.i8.u4.State_10_7==1)&&(i2.i3.u22.State_0_7==1))||((i2.i2.u20.State_0_2==1)&&(i0.i0.u11.State_10_2==1)))||(...123748
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),!(!(E(TRUE U !(!(((((((i0.i8.u4.State_10_7==1)&&(i2.i3.u22.State_0_7==1))||((i2.i2.u20.St...125118
Reverse transition relation is NOT exact ! Due to transitions t12, t46, t47, t56, t97, t109, t126, t136, t144, t150, t157, t179, t190, t253, t330, t338, t3...2996
(forward)formula 0,1,12.2898,331440,1,0,543388,206,17711,999990,69,978,2027608
FORMULA TokenRing-PT-010-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:54:31] [INFO ] Invariant cache hit.
[2024-05-29 17:54:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 17:54:31] [INFO ] Invariant cache hit.
[2024-05-29 17:54:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:54:31] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:54:31] [INFO ] Invariant cache hit.
[2024-05-29 17:54:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:54:39] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 4 ms to minimize.
[2024-05-29 17:54:40] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 4 ms to minimize.
[2024-05-29 17:54:40] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 2 ms to minimize.
[2024-05-29 17:54:40] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:54:41] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:54:41] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:54:41] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:54:41] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:54:42] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:54:42] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:54:42] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:54:42] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:54:43] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:54:43] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:54:43] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 2 ms to minimize.
[2024-05-29 17:54:43] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 10 ms to minimize.
[2024-05-29 17:54:44] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:54:44] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:54:44] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 4 ms to minimize.
[2024-05-29 17:54:44] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:54:46] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-05-29 17:54:46] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 1 ms to minimize.
[2024-05-29 17:54:46] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-05-29 17:54:46] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:54:46] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:54:47] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:54:47] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 4 ms to minimize.
[2024-05-29 17:54:47] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:54:47] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:54:48] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:54:48] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:54:48] [INFO ] Deduced a trap composed of 68 places in 277 ms of which 3 ms to minimize.
[2024-05-29 17:54:48] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:54:49] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:54:49] [INFO ] Deduced a trap composed of 65 places in 285 ms of which 3 ms to minimize.
[2024-05-29 17:54:49] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 2 ms to minimize.
[2024-05-29 17:54:50] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:54:50] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 17:54:50] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:54:50] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:54:58] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 2 ms to minimize.
[2024-05-29 17:54:59] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:54:59] [INFO ] Deduced a trap composed of 68 places in 276 ms of which 2 ms to minimize.
[2024-05-29 17:54:59] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 2 ms to minimize.
[2024-05-29 17:54:59] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:55:00] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:55:00] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-29 17:55:00] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:55:00] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:55:01] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:55:01] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:55:01] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:55:01] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-05-29 17:55:02] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2024-05-29 17:55:02] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:55:02] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-29 17:55:02] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:55:02] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:55:02] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:55:03] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30036 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:55:06] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-05-29 17:55:06] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:55:07] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:55:07] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:55:07] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:55:08] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:55:08] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:55:08] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:55:08] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:55:08] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 1 ms to minimize.
[2024-05-29 17:55:09] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 1 ms to minimize.
[2024-05-29 17:55:09] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 1 ms to minimize.
[2024-05-29 17:55:09] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:55:09] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 1 ms to minimize.
[2024-05-29 17:55:09] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 1 ms to minimize.
[2024-05-29 17:55:10] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-05-29 17:55:10] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 3 ms to minimize.
[2024-05-29 17:55:10] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:55:10] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:55:11] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:55:13] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 2 ms to minimize.
[2024-05-29 17:55:14] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:55:14] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:55:14] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2024-05-29 17:55:14] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:55:14] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:55:15] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:55:15] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 2 ms to minimize.
[2024-05-29 17:55:15] [INFO ] Deduced a trap composed of 63 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:55:16] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:55:16] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:55:16] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:55:16] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:55:17] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:55:17] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:55:17] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:55:17] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:55:18] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:55:18] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:55:18] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:55:21] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 3 ms to minimize.
[2024-05-29 17:55:21] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:55:22] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:55:22] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 2 ms to minimize.
[2024-05-29 17:55:22] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
[2024-05-29 17:55:22] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:55:23] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:55:23] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:55:23] [INFO ] Deduced a trap composed of 68 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:55:23] [INFO ] Deduced a trap composed of 69 places in 277 ms of which 2 ms to minimize.
[2024-05-29 17:55:24] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:55:24] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:55:24] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:55:25] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:55:25] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:55:25] [INFO ] Deduced a trap composed of 68 places in 281 ms of which 2 ms to minimize.
[2024-05-29 17:55:26] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 2 ms to minimize.
[2024-05-29 17:55:26] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:55:26] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:55:26] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:55:29] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
[2024-05-29 17:55:29] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:55:29] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:55:29] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 3 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:55:33] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:55:33] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
SMT process timed out in 61556ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61590ms
Finished structural reductions in LTL mode , in 1 iterations and 62339 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:55:33] [INFO ] Flatten gal took : 64 ms
[2024-05-29 17:55:33] [INFO ] Flatten gal took : 90 ms
[2024-05-29 17:55:33] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:55:34] [INFO ] Flatten gal took : 89 ms
[2024-05-29 17:55:34] [INFO ] Flatten gal took : 86 ms
[2024-05-29 17:55:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2193344435964252151.gal : 14 ms
[2024-05-29 17:55:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17921756860790194262.ctl : 29 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2193344435964252151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17921756860790194262.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.1538,46696,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: (E(!(((((((State_10_7==1)&&(State_0_7==1))||((State_0_2==1)&&(State_10_2==1)))||(((State_10_1==1)&&(State_0_1==1))||((State_0_6==1)&&(Sta...120589
=> equivalent forward existential formula: [(EY((Init * E(!(((((((State_10_7==1)&&(State_0_7==1))||((State_0_2==1)&&(State_10_2==1)))||(((State_10_1==1)&&(...200487
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,22.642,288196,1,0,1047,664480,1478,348,15185,472148,1524
FORMULA TokenRing-PT-010-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 33 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:55:57] [INFO ] Invariant cache hit.
[2024-05-29 17:55:57] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 17:55:57] [INFO ] Invariant cache hit.
[2024-05-29 17:55:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:55:57] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-29 17:55:57] [INFO ] Redundant transitions in 91 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:55:57] [INFO ] Invariant cache hit.
[2024-05-29 17:55:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:56:05] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 4 ms to minimize.
[2024-05-29 17:56:06] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:56:06] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:56:06] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:56:06] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:56:07] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:56:07] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:56:07] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:56:08] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 2 ms to minimize.
[2024-05-29 17:56:08] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:56:08] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:56:08] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:56:09] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:56:09] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 2 ms to minimize.
[2024-05-29 17:56:09] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:56:09] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:56:09] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:56:10] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:56:10] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:56:10] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:56:13] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 2 ms to minimize.
[2024-05-29 17:56:13] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:56:13] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 3 ms to minimize.
[2024-05-29 17:56:14] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:56:14] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:56:14] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:56:14] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:56:16] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:56:16] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-29 17:56:16] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:56:16] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:56:17] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 2 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 3 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 2 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:56:28] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:56:28] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 2 ms to minimize.
[2024-05-29 17:56:28] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 3 ms to minimize.
[2024-05-29 17:56:29] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 3 ms to minimize.
SMT process timed out in 31460ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31476ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 32073 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:56:29] [INFO ] Flatten gal took : 49 ms
[2024-05-29 17:56:29] [INFO ] Flatten gal took : 67 ms
[2024-05-29 17:56:29] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:56:29] [INFO ] Flatten gal took : 67 ms
[2024-05-29 17:56:29] [INFO ] Flatten gal took : 68 ms
[2024-05-29 17:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3310345860442610838.gal : 7 ms
[2024-05-29 17:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15711115440112335692.ctl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3310345860442610838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15711115440112335692.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,1.97921,46960,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EF(((((EG(((((((((((((((State_6_10==1)&&(State_5_7==1))||((State_6_3==1)&&(State_7_8==1)))||(((State_4_5==1)&&(State_5_7==1))||((State_7_...81482
=> equivalent forward existential formula: (((([FwdG(FwdU(Init,TRUE),((((((((((((((State_6_10==1)&&(State_5_7==1))||((State_6_3==1)&&(State_7_8==1)))||(((S...81656
Hit Full ! (commute/partial/dont) 0/0/1111
(forward)formula 0,1,11.4193,251456,1,0,63,569835,20,2,9556,313930,64
FORMULA TokenRing-PT-010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:56:41] [INFO ] Invariant cache hit.
[2024-05-29 17:56:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:56:41] [INFO ] Invariant cache hit.
[2024-05-29 17:56:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:56:41] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:56:41] [INFO ] Invariant cache hit.
[2024-05-29 17:56:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:56:50] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:56:50] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:56:50] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:56:51] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:56:51] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:56:51] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:56:51] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:56:52] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:56:52] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:56:52] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:56:53] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:56:53] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 3 ms to minimize.
[2024-05-29 17:56:53] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:56:53] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 2 ms to minimize.
[2024-05-29 17:56:54] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:56:54] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:56:54] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:56:54] [INFO ] Deduced a trap composed of 63 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:56:55] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:56:55] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:56:56] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:56:56] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-05-29 17:56:57] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-29 17:56:57] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:56:57] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:56:57] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:56:58] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:56:58] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:56:58] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:56:59] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:56:59] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:56:59] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:56:59] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:57:00] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-05-29 17:57:00] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:57:00] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:57:00] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:57:01] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:57:01] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:57:01] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:57:08] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:57:09] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:57:09] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:57:09] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:57:09] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:57:10] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:57:10] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-05-29 17:57:10] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 1 ms to minimize.
[2024-05-29 17:57:10] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:57:10] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:57:11] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:57:11] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:57:11] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 2 ms to minimize.
[2024-05-29 17:57:11] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 2 ms to minimize.
[2024-05-29 17:57:11] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 2 ms to minimize.
[2024-05-29 17:57:12] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-05-29 17:57:12] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:57:12] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:57:13] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 2 ms to minimize.
[2024-05-29 17:57:13] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30043 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 3 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 3 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 1 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 2 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 2 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:57:20] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:57:20] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:57:20] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:57:20] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:57:21] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:57:21] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:57:21] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:57:22] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 2 ms to minimize.
[2024-05-29 17:57:22] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:57:22] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:57:24] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 2 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 7 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 3 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 2 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 2 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:57:35] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:57:35] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 2 ms to minimize.
[2024-05-29 17:57:35] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:57:37] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:57:37] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:57:39] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:57:40] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:57:40] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:57:40] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:57:40] [INFO ] Deduced a trap composed of 68 places in 178 ms of which 2 ms to minimize.
[2024-05-29 17:57:41] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:57:41] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:57:41] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:57:41] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 2 ms to minimize.
[2024-05-29 17:57:41] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-05-29 17:57:42] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-05-29 17:57:42] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:57:42] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 1 ms to minimize.
[2024-05-29 17:57:42] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:57:42] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 6 ms to minimize.
[2024-05-29 17:57:43] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:57:43] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 269 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30032 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 137/137 constraints]
After SMT, in 61536ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61566ms
Finished structural reductions in LTL mode , in 1 iterations and 62257 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:57:43] [INFO ] Flatten gal took : 52 ms
[2024-05-29 17:57:43] [INFO ] Flatten gal took : 71 ms
[2024-05-29 17:57:43] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:57:43] [INFO ] Flatten gal took : 67 ms
[2024-05-29 17:57:43] [INFO ] Flatten gal took : 69 ms
[2024-05-29 17:57:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13094947297651852513.gal : 8 ms
[2024-05-29 17:57:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7569026143274565013.ctl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13094947297651852513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7569026143274565013.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,1.92084,46960,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: AF((AG(EF((((((((State_10_7!=1)||(State_0_7!=1))&&((State_0_2!=1)||(State_10_2!=1)))&&(((State_10_1!=1)||(State_0_1!=1))&&((State_0_6!=1)...81511
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(E(TRUE U (((((((State_10_7!=1)||(State_0_7!=1))&&((State_0_2!=1)||(State_10_2!=1)))&&...81598
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
Detected timeout of ITS tools.
[2024-05-29 17:58:14] [INFO ] Flatten gal took : 38 ms
[2024-05-29 17:58:14] [INFO ] Applying decomposition
[2024-05-29 17:58:14] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17130202834820158530.txt' '-o' '/tmp/graph17130202834820158530.bin' '-w' '/tmp/graph17130202834820158530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17130202834820158530.bin' '-l' '-1' '-v' '-w' '/tmp/graph17130202834820158530.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:58:14] [INFO ] Decomposing Gal with order
[2024-05-29 17:58:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:58:14] [INFO ] Removed a total of 2367 redundant transitions.
[2024-05-29 17:58:14] [INFO ] Flatten gal took : 98 ms
[2024-05-29 17:58:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 24 ms.
[2024-05-29 17:58:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2830520390342364903.gal : 9 ms
[2024-05-29 17:58:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2513624834110074267.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2830520390342364903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2513624834110074267.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,4.63615,114212,1998,14,188311,243,1518,210275,17,721,0
Converting to forward existential form...Done !
original formula: AF((AG(EF((((((((i2.i5.u6.State_10_7!=1)||(i1.i2.u24.State_0_7!=1))&&((i1.i3.u27.State_0_2!=1)||(i2.i9.u33.State_10_2!=1)))&&(((i2.i4.u37...124975
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(E(TRUE U (((((((i2.i5.u6.State_10_7!=1)||(i1.i2.u24.State_0_7!=1))&&((i1.i3.u27.State...125062
Reverse transition relation is NOT exact ! Due to transitions t29, t49, t69, t79, t83, t97, t126, t147, t160, t179, t296, t309, t323, t330, t345, t358, t36...2935
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 26 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:58:44] [INFO ] Invariant cache hit.
[2024-05-29 17:58:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:58:44] [INFO ] Invariant cache hit.
[2024-05-29 17:58:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:58:45] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-29 17:58:45] [INFO ] Redundant transitions in 45 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:58:45] [INFO ] Invariant cache hit.
[2024-05-29 17:58:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 1 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:58:56] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:58:56] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:58:56] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 3 ms to minimize.
[2024-05-29 17:58:57] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 3 ms to minimize.
[2024-05-29 17:58:57] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:58:57] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:58:57] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:58:58] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:58:58] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:58:58] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:58:59] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:59:00] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:59:00] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:59:00] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 2 ms to minimize.
[2024-05-29 17:59:00] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 1 ms to minimize.
[2024-05-29 17:59:00] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:59:01] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 3 ms to minimize.
[2024-05-29 17:59:01] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:59:01] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:59:01] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:59:02] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:59:02] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 3 ms to minimize.
[2024-05-29 17:59:02] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:59:02] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:59:03] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:59:03] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:59:03] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:59:04] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:59:04] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 4 ms to minimize.
[2024-05-29 17:59:04] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:59:04] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:59:12] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 17:59:12] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:59:13] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:59:13] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:59:13] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:59:14] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:59:14] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:59:14] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:59:14] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:59:15] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:59:15] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:59:15] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:59:15] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 3 ms to minimize.
[2024-05-29 17:59:16] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 3 ms to minimize.
[2024-05-29 17:59:16] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 2 ms to minimize.
[2024-05-29 17:59:16] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
SMT process timed out in 31419ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31446ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 32155 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:59:17] [INFO ] Flatten gal took : 50 ms
[2024-05-29 17:59:17] [INFO ] Flatten gal took : 70 ms
[2024-05-29 17:59:17] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:59:17] [INFO ] Flatten gal took : 69 ms
[2024-05-29 17:59:17] [INFO ] Flatten gal took : 70 ms
[2024-05-29 17:59:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16220048834047076928.gal : 8 ms
[2024-05-29 17:59:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5937762829159946968.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16220048834047076928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5937762829159946968.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.21917,46692,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EG(!(A(((((((State_10_7==1)&&(State_0_7==1))||((State_0_2==1)&&(State_10_2==1)))||(((State_10_1==1)&&(State_0_1==1))||((State_0_6==1)&&(S...80257
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(!(E((((((((((((((State_6_10==1)&&(State_5_7==1))||((State_6_3==1)&&(State_7_8==1)))||(((Stat...239971
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
Detected timeout of ITS tools.
[2024-05-29 17:59:47] [INFO ] Flatten gal took : 41 ms
[2024-05-29 17:59:47] [INFO ] Applying decomposition
[2024-05-29 17:59:47] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3105583385126330561.txt' '-o' '/tmp/graph3105583385126330561.bin' '-w' '/tmp/graph3105583385126330561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3105583385126330561.bin' '-l' '-1' '-v' '-w' '/tmp/graph3105583385126330561.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:59:47] [INFO ] Decomposing Gal with order
[2024-05-29 17:59:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:59:47] [INFO ] Removed a total of 2358 redundant transitions.
[2024-05-29 17:59:47] [INFO ] Flatten gal took : 91 ms
[2024-05-29 17:59:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 22 ms.
[2024-05-29 17:59:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1523574690743242579.gal : 6 ms
[2024-05-29 17:59:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16521134550757297780.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1523574690743242579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16521134550757297780.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,0.62162,19700,1467,14,22176,573,1665,46792,17,1166,0
Converting to forward existential form...Done !
original formula: EG(!(A(((((((i0.u5.State_10_7==1)&&(i3.i0.i1.u43.State_0_7==1))||((i2.u20.State_0_2==1)&&(i0.u12.State_10_2==1)))||(((i0.u40.State_10_1==...115631
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(!(E((((((((((((((i0.u26.State_6_10==1)&&(i3.i0.i1.u18.State_5_7==1))||((i0.u11.State_6_3==1)...345745
Reverse transition relation is NOT exact ! Due to transitions t46, t51, t56, t95, t97, t109, t126, t136, t144, t150, t151, t167, t179, t190, t199, t214, t2...2936
(forward)formula 0,0,8.57226,165692,1,0,337933,573,16268,469192,66,1166,1234621
FORMULA TokenRing-PT-010-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 94 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:59:56] [INFO ] Invariant cache hit.
[2024-05-29 17:59:57] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-29 17:59:57] [INFO ] Invariant cache hit.
[2024-05-29 17:59:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:59:58] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2024-05-29 17:59:58] [INFO ] Redundant transitions in 28 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:59:58] [INFO ] Invariant cache hit.
[2024-05-29 17:59:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:07] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:00:07] [INFO ] Deduced a trap composed of 67 places in 279 ms of which 5 ms to minimize.
[2024-05-29 18:00:07] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:00:08] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:00:08] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 2 ms to minimize.
[2024-05-29 18:00:08] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 18:00:08] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
[2024-05-29 18:00:09] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:00:09] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:00:09] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:00:10] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:00:10] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-05-29 18:00:10] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 18:00:10] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 2 ms to minimize.
[2024-05-29 18:00:11] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 2 ms to minimize.
[2024-05-29 18:00:11] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:00:11] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-05-29 18:00:11] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 2 ms to minimize.
[2024-05-29 18:00:12] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 5 ms to minimize.
[2024-05-29 18:00:12] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:13] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:00:13] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:00:14] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:00:14] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:00:14] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 2 ms to minimize.
[2024-05-29 18:00:14] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:00:15] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 3 ms to minimize.
[2024-05-29 18:00:15] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:00:15] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:00:15] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 1 ms to minimize.
[2024-05-29 18:00:15] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:00:16] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 2 ms to minimize.
[2024-05-29 18:00:16] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 2 ms to minimize.
[2024-05-29 18:00:16] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:00:16] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-05-29 18:00:16] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-05-29 18:00:16] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:00:17] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 3 ms to minimize.
[2024-05-29 18:00:17] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 18:00:17] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:24] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:00:25] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:00:25] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:00:25] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:00:25] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-29 18:00:26] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 2 ms to minimize.
[2024-05-29 18:00:26] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2024-05-29 18:00:26] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:00:27] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 2 ms to minimize.
[2024-05-29 18:00:27] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:00:27] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 2 ms to minimize.
[2024-05-29 18:00:27] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:00:28] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:00:28] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 2 ms to minimize.
[2024-05-29 18:00:28] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:00:28] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:00:29] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:00:29] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:00:29] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 18:00:29] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30030 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:33] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 2 ms to minimize.
[2024-05-29 18:00:33] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:00:33] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:00:34] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:00:34] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:00:34] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:00:35] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:00:35] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 18:00:35] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 2 ms to minimize.
[2024-05-29 18:00:35] [INFO ] Deduced a trap composed of 63 places in 275 ms of which 2 ms to minimize.
[2024-05-29 18:00:36] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:00:36] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:00:36] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 3 ms to minimize.
[2024-05-29 18:00:36] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:00:37] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
[2024-05-29 18:00:37] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 18:00:37] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:00:37] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 2 ms to minimize.
[2024-05-29 18:00:38] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 18:00:38] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:40] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 3 ms to minimize.
[2024-05-29 18:00:40] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 2 ms to minimize.
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 2 ms to minimize.
[2024-05-29 18:00:42] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:00:42] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:00:42] [INFO ] Deduced a trap composed of 63 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 2 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 65 places in 285 ms of which 3 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:47] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 2 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 3 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 2 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 3 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:00:53] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 1 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 2 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 2 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 3 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 3 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 2 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 1 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 2 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:00:59] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30026 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 61439ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61467ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 63765 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:01:00] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:01:00] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:01:00] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:01:00] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:01:00] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:01:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9268200958292068722.gal : 7 ms
[2024-05-29 18:01:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9950178744308886089.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9268200958292068722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9950178744308886089.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.09457,46440,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EG(((((AF(((((((State_10_7==0)||(State_0_7==0))&&((State_0_2==0)||(State_10_2==0)))&&(((State_10_1==0)||(State_0_1==0))&&((State_0_6==0)|...844
=> equivalent forward existential formula: [FwdG(Init,((((!(EG(!(((((((State_10_7==0)||(State_0_7==0))&&((State_0_2==0)||(State_10_2==0)))&&(((State_10_1==...893
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,1,13.4958,282796,1,0,1043,698450,1475,348,12820,501423,1523
FORMULA TokenRing-PT-010-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:01:14] [INFO ] Invariant cache hit.
[2024-05-29 18:01:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 18:01:14] [INFO ] Invariant cache hit.
[2024-05-29 18:01:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:01:14] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:01:14] [INFO ] Invariant cache hit.
[2024-05-29 18:01:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 2 ms to minimize.
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 2 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 1 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 3 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 2 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 2 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 3 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 2 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 18:01:27] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 2 ms to minimize.
[2024-05-29 18:01:27] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:01:27] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 18:01:28] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:01:28] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:01:28] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-05-29 18:01:28] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-29 18:01:29] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:01:29] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 1 ms to minimize.
[2024-05-29 18:01:29] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:01:29] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:01:29] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-05-29 18:01:30] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:01:30] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 18:01:30] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:01:30] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-05-29 18:01:31] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 3 ms to minimize.
[2024-05-29 18:01:31] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:01:37] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 18:01:38] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 2 ms to minimize.
[2024-05-29 18:01:38] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:01:38] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:01:38] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:01:39] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 1 ms to minimize.
[2024-05-29 18:01:39] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 2 ms to minimize.
[2024-05-29 18:01:39] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 2 ms to minimize.
[2024-05-29 18:01:39] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:01:39] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:01:40] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 2 ms to minimize.
[2024-05-29 18:01:40] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:01:40] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 18:01:40] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:01:41] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:01:41] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:01:41] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:01:42] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:01:42] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:01:42] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:01:44] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:01:44] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:01:45] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 2 ms to minimize.
[2024-05-29 18:01:45] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 2 ms to minimize.
[2024-05-29 18:01:45] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:01:45] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 2 ms to minimize.
[2024-05-29 18:01:46] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 199 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30031 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 67/199 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 2 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 2 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 2 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 3 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:01:56] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:01:56] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:01:56] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2024-05-29 18:01:57] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:01:57] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 2 ms to minimize.
[2024-05-29 18:01:57] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 2 ms to minimize.
[2024-05-29 18:01:57] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:01:58] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:01:58] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 2 ms to minimize.
[2024-05-29 18:01:58] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 3 ms to minimize.
[2024-05-29 18:01:58] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:01:59] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 2 ms to minimize.
[2024-05-29 18:01:59] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 3 ms to minimize.
[2024-05-29 18:01:59] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 2 ms to minimize.
[2024-05-29 18:01:59] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:02:00] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:02:00] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:02:00] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 2 ms to minimize.
[2024-05-29 18:02:01] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:02:01] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:02:04] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
[2024-05-29 18:02:04] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:02:04] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:02:05] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:02:05] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:02:05] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 3 ms to minimize.
[2024-05-29 18:02:05] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 18:02:06] [INFO ] Deduced a trap composed of 63 places in 195 ms of which 2 ms to minimize.
[2024-05-29 18:02:06] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:02:06] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:02:07] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 2 ms to minimize.
[2024-05-29 18:02:07] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 3 ms to minimize.
[2024-05-29 18:02:07] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:02:07] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 3 ms to minimize.
[2024-05-29 18:02:08] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 2 ms to minimize.
[2024-05-29 18:02:08] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 2 ms to minimize.
[2024-05-29 18:02:08] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:02:08] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 1 ms to minimize.
[2024-05-29 18:02:09] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:02:09] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 3 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 2 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 2 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 2 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:02:15] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 3 ms to minimize.
[2024-05-29 18:02:15] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:02:15] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 18:02:15] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 18:02:16] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:02:16] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 61503ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61533ms
Finished structural reductions in LTL mode , in 1 iterations and 62227 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:02:16] [INFO ] Flatten gal took : 68 ms
[2024-05-29 18:02:17] [INFO ] Flatten gal took : 119 ms
[2024-05-29 18:02:17] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:02:17] [INFO ] Flatten gal took : 119 ms
[2024-05-29 18:02:17] [INFO ] Flatten gal took : 117 ms
[2024-05-29 18:02:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3354729594005131059.gal : 5 ms
[2024-05-29 18:02:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12767744878176369416.ctl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3354729594005131059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12767744878176369416.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,1.90702,47228,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: AF((((EG((((((((State_10_7!=1)||(State_0_7!=1))&&((State_0_2!=1)||(State_10_2!=1)))&&(((State_10_1!=1)||(State_0_1!=1))&&((State_0_6!=1)|...242376
=> equivalent forward existential formula: [FwdG(Init,!((((EG((((((((State_10_7!=1)||(State_0_7!=1))&&((State_0_2!=1)||(State_10_2!=1)))&&(((State_10_1!=1)...322274
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
Detected timeout of ITS tools.
[2024-05-29 18:02:47] [INFO ] Flatten gal took : 84 ms
[2024-05-29 18:02:47] [INFO ] Applying decomposition
[2024-05-29 18:02:48] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2215024711814539601.txt' '-o' '/tmp/graph2215024711814539601.bin' '-w' '/tmp/graph2215024711814539601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2215024711814539601.bin' '-l' '-1' '-v' '-w' '/tmp/graph2215024711814539601.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:02:48] [INFO ] Decomposing Gal with order
[2024-05-29 18:02:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:02:48] [INFO ] Removed a total of 2358 redundant transitions.
[2024-05-29 18:02:48] [INFO ] Flatten gal took : 190 ms
[2024-05-29 18:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 9 ms.
[2024-05-29 18:02:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6211630321282682936.gal : 9 ms
[2024-05-29 18:02:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14358132310991608013.ctl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6211630321282682936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14358132310991608013.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,0.764016,24244,2594,14,30367,168,1555,40214,17,435,0
Converting to forward existential form...Done !
original formula: AF((((EG((((((((i0.i4.u6.State_10_7!=1)||(i1.i6.u27.State_0_7!=1))&&((i1.i1.u32.State_0_2!=1)||(i0.i0.u34.State_10_2!=1)))&&(((i0.i10.u47...371914
=> equivalent forward existential formula: [FwdG(Init,!((((EG((((((((i0.i4.u6.State_10_7!=1)||(i1.i6.u27.State_0_7!=1))&&((i1.i1.u32.State_0_2!=1)||(i0.i0....494492
Reverse transition relation is NOT exact ! Due to transitions t29, t49, t56, t97, t109, t126, t136, t144, t150, t167, t190, t201, t233, t253, t263, t296, t...2948
(forward)formula 0,0,11.9933,248116,1,0,405652,180,15367,554160,69,905,1755761
FORMULA TokenRing-PT-010-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:03:01] [INFO ] Invariant cache hit.
[2024-05-29 18:03:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:03:01] [INFO ] Invariant cache hit.
[2024-05-29 18:03:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:03:01] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:03:01] [INFO ] Invariant cache hit.
[2024-05-29 18:03:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:03:09] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:03:10] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2024-05-29 18:03:10] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
[2024-05-29 18:03:10] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 18:03:10] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:03:11] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 18:03:11] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:03:11] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:03:11] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:03:12] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:03:12] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:03:12] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:03:12] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 1 ms to minimize.
[2024-05-29 18:03:13] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:03:13] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2024-05-29 18:03:13] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:03:13] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:03:13] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
[2024-05-29 18:03:14] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:03:14] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:03:15] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
[2024-05-29 18:03:16] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:03:16] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:03:16] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:03:16] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:03:17] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 18:03:17] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-29 18:03:17] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:03:17] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 2 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:03:19] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:03:19] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:03:19] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:03:20] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:03:20] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:03:20] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:03:20] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:03:28] [INFO ] Deduced a trap composed of 65 places in 297 ms of which 3 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 2 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:03:30] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 3 ms to minimize.
[2024-05-29 18:03:30] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 2 ms to minimize.
[2024-05-29 18:03:30] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 18:03:30] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:03:31] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:03:31] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:03:31] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 3 ms to minimize.
[2024-05-29 18:03:31] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 18:03:32] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:03:32] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2024-05-29 18:03:32] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-05-29 18:03:32] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2024-05-29 18:03:33] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:03:33] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
SMT process timed out in 31386ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31410ms
Finished structural reductions in LTL mode , in 1 iterations and 32082 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:03:33] [INFO ] Flatten gal took : 50 ms
[2024-05-29 18:03:33] [INFO ] Flatten gal took : 78 ms
[2024-05-29 18:03:33] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:03:33] [INFO ] Flatten gal took : 48 ms
[2024-05-29 18:03:33] [INFO ] Flatten gal took : 50 ms
[2024-05-29 18:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2632709971334195758.gal : 8 ms
[2024-05-29 18:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15546950214744141661.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2632709971334195758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15546950214744141661.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,1.92495,46964,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: AX(AF(((A((((((((((((((State_6_10==1)&&(State_5_7==1))||((State_6_3==1)&&(State_7_8==1)))||(((State_4_5==1)&&(State_5_7==1))||((State_7_8...121000
=> equivalent forward existential formula: [FwdG(EY(Init),!(((!((E(!((((((((((((((State_6_10==1)&&(State_5_7==1))||((State_6_3==1)&&(State_7_8==1)))||(((St...200892
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,29.7888,608244,1,0,1157,1.97116e+06,1477,400,15182,1.45183e+06,1737
FORMULA TokenRing-PT-010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 83 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:04:04] [INFO ] Invariant cache hit.
[2024-05-29 18:04:04] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-29 18:04:04] [INFO ] Invariant cache hit.
[2024-05-29 18:04:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:04:06] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2024-05-29 18:04:06] [INFO ] Redundant transitions in 29 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:04:06] [INFO ] Invariant cache hit.
[2024-05-29 18:04:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:04:14] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 2 ms to minimize.
[2024-05-29 18:04:14] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 2 ms to minimize.
[2024-05-29 18:04:14] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 3 ms to minimize.
[2024-05-29 18:04:15] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:04:15] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:04:15] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 2 ms to minimize.
[2024-05-29 18:04:15] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:04:16] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:04:16] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:04:16] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:04:16] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
[2024-05-29 18:04:17] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 2 ms to minimize.
[2024-05-29 18:04:17] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-05-29 18:04:17] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 3 ms to minimize.
[2024-05-29 18:04:18] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:04:18] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:04:18] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 3 ms to minimize.
[2024-05-29 18:04:18] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:04:19] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 3 ms to minimize.
[2024-05-29 18:04:19] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:04:20] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:04:20] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:04:21] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 2 ms to minimize.
[2024-05-29 18:04:21] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 2 ms to minimize.
[2024-05-29 18:04:21] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:04:22] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:04:22] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 18:04:22] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:04:22] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 2 ms to minimize.
[2024-05-29 18:04:23] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:04:23] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 2 ms to minimize.
[2024-05-29 18:04:23] [INFO ] Deduced a trap composed of 68 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:04:24] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:04:24] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:04:24] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 3 ms to minimize.
[2024-05-29 18:04:24] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
[2024-05-29 18:04:24] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2024-05-29 18:04:25] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:04:25] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:04:25] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 2 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 2 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 3 ms to minimize.
[2024-05-29 18:04:35] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-29 18:04:35] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 3 ms to minimize.
[2024-05-29 18:04:35] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 2 ms to minimize.
[2024-05-29 18:04:36] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:04:36] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 18:04:36] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 2 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
SMT process timed out in 31277ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31299ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 33656 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:04:37] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:04:37] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:04:37] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:04:37] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:04:37] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:04:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7469281306937325749.gal : 7 ms
[2024-05-29 18:04:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8706819912241044763.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7469281306937325749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8706819912241044763.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.34644,46436,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: AF(EG(((((State_6_1==1)&&(State_7_2==1))||((State_2_4==1)&&(State_3_3==1)))||((State_5_1==1)&&(State_4_9==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((State_6_1==1)&&(State_7_2==1))||((State_2_4==1)&&(State_3_3==1)))||((State_5_1==1)&&(State_4...175
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,15.3113,295456,1,0,1073,754355,1470,355,12714,523844,1563
FORMULA TokenRing-PT-010-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 12 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:04:53] [INFO ] Invariant cache hit.
[2024-05-29 18:04:53] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-29 18:04:53] [INFO ] Invariant cache hit.
[2024-05-29 18:04:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:04:55] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:04:55] [INFO ] Invariant cache hit.
[2024-05-29 18:04:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 2 ms to minimize.
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 3 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 2 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 2 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 3 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 2 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 2 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 3 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 63 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:05:09] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2024-05-29 18:05:10] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:05:10] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:05:10] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 2 ms to minimize.
[2024-05-29 18:05:11] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 18:05:11] [INFO ] Deduced a trap composed of 66 places in 289 ms of which 3 ms to minimize.
[2024-05-29 18:05:11] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
[2024-05-29 18:05:11] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:05:12] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:05:12] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:05:12] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 3 ms to minimize.
[2024-05-29 18:05:13] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:05:13] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 2 ms to minimize.
[2024-05-29 18:05:13] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 2 ms to minimize.
[2024-05-29 18:05:13] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:05:14] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:05:14] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:05:14] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:05:14] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:05:15] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:05:23] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 18:05:23] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 3 ms to minimize.
[2024-05-29 18:05:23] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:05:23] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 3 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 3 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 3 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 2 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 2 ms to minimize.
[2024-05-29 18:05:27] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 31504ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31529ms
Finished structural reductions in LTL mode , in 1 iterations and 33723 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:05:27] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:05:27] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:05:27] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:05:27] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:05:27] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:05:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13908565266860233843.gal : 6 ms
[2024-05-29 18:05:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7663671515619855265.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13908565266860233843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7663671515619855265.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.35339,46428,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(A((AG(!(((State_8_8==1)&&(State_7_3==1)))) + AX(((State_8_1==1)&&(State_9_4==1)))) U ((State_9_4==1)&&(State_10_8==1))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((State_9_4==1)&&(State_10_8==1)))))) * !(E(!(((State_9_4==1)&&(State_10_8==1))) U (!((!(E(...302
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,12.8697,280752,1,0,1058,677873,1474,360,12500,473730,1535
FORMULA TokenRing-PT-010-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:05:40] [INFO ] Invariant cache hit.
[2024-05-29 18:05:40] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 18:05:40] [INFO ] Invariant cache hit.
[2024-05-29 18:05:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:05:42] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:05:42] [INFO ] Invariant cache hit.
[2024-05-29 18:05:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:05:50] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 18:05:50] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:05:50] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-05-29 18:05:51] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 18:05:51] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:05:51] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 3 ms to minimize.
[2024-05-29 18:05:51] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:05:52] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 18:05:52] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:05:52] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 2 ms to minimize.
[2024-05-29 18:05:52] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:05:53] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:05:53] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:05:53] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:05:53] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
[2024-05-29 18:05:54] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:05:54] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 18:05:54] [INFO ] Deduced a trap composed of 63 places in 264 ms of which 3 ms to minimize.
[2024-05-29 18:05:55] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 2 ms to minimize.
[2024-05-29 18:05:55] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:05:56] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-29 18:05:57] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:05:57] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 18:05:57] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:05:57] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:05:58] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 2 ms to minimize.
[2024-05-29 18:05:58] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-29 18:05:58] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:05:58] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:05:59] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 3 ms to minimize.
[2024-05-29 18:05:59] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:05:59] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 3 ms to minimize.
[2024-05-29 18:05:59] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-05-29 18:06:00] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-05-29 18:06:00] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 18:06:00] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 3 ms to minimize.
[2024-05-29 18:06:00] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:06:01] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:06:01] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
[2024-05-29 18:06:01] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:06:08] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:06:09] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:06:09] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:06:09] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 2 ms to minimize.
[2024-05-29 18:06:09] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:06:10] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 3 ms to minimize.
[2024-05-29 18:06:10] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2024-05-29 18:06:10] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 3 ms to minimize.
[2024-05-29 18:06:10] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 18:06:11] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 3 ms to minimize.
[2024-05-29 18:06:11] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 2 ms to minimize.
[2024-05-29 18:06:11] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-29 18:06:11] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 2 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
SMT process timed out in 31288ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31304ms
Finished structural reductions in LTL mode , in 1 iterations and 33547 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:06:13] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:06:13] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:06:13] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:06:14] [INFO ] Flatten gal took : 36 ms
[2024-05-29 18:06:14] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8227494653384754689.gal : 6 ms
[2024-05-29 18:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13841888456805800267.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8227494653384754689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13841888456805800267.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.25136,46700,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(EF(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,6.76438,142216,1,0,982,338423,1461,342,12379,279678,1454
FORMULA TokenRing-PT-010-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:06:20] [INFO ] Invariant cache hit.
[2024-05-29 18:06:21] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-29 18:06:21] [INFO ] Invariant cache hit.
[2024-05-29 18:06:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:06:23] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:06:23] [INFO ] Invariant cache hit.
[2024-05-29 18:06:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:06:30] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 2 ms to minimize.
[2024-05-29 18:06:31] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 3 ms to minimize.
[2024-05-29 18:06:31] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:06:31] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 18:06:31] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:06:32] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:06:32] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-05-29 18:06:32] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 1 ms to minimize.
[2024-05-29 18:06:32] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
[2024-05-29 18:06:33] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 2 ms to minimize.
[2024-05-29 18:06:33] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 1 ms to minimize.
[2024-05-29 18:06:33] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 2 ms to minimize.
[2024-05-29 18:06:33] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-05-29 18:06:33] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:06:34] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:06:34] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
[2024-05-29 18:06:34] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-05-29 18:06:34] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 1 ms to minimize.
[2024-05-29 18:06:34] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2024-05-29 18:06:35] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:06:36] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:06:36] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:06:36] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 2 ms to minimize.
[2024-05-29 18:06:37] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:06:37] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 18:06:37] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 2 ms to minimize.
[2024-05-29 18:06:38] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 2 ms to minimize.
[2024-05-29 18:06:38] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:06:38] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:06:38] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:06:39] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:06:39] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 2 ms to minimize.
[2024-05-29 18:06:39] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:06:39] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 18:06:40] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 18:06:40] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 3 ms to minimize.
[2024-05-29 18:06:40] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 18:06:41] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:06:41] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:06:41] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:06:49] [INFO ] Deduced a trap composed of 65 places in 296 ms of which 2 ms to minimize.
[2024-05-29 18:06:49] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 3 ms to minimize.
[2024-05-29 18:06:49] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 2 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 3 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2024-05-29 18:06:51] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 3 ms to minimize.
[2024-05-29 18:06:51] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 2 ms to minimize.
[2024-05-29 18:06:51] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:06:52] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 2 ms to minimize.
[2024-05-29 18:06:52] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:06:52] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 18:06:52] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 18:06:53] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 2 ms to minimize.
[2024-05-29 18:06:53] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:06:53] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 18:06:53] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-05-29 18:06:54] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2024-05-29 18:06:54] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 2 ms to minimize.
SMT process timed out in 31293ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31317ms
Finished structural reductions in LTL mode , in 1 iterations and 33408 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:06:54] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:06:54] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:06:54] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:06:54] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:06:54] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9432040442784234688.gal : 8 ms
[2024-05-29 18:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12170433220804892851.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9432040442784234688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12170433220804892851.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.32327,46692,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(EF(((AX(((State_9_7==1)&&(State_8_8==1))) * ((State_2_2==0)||(State_3_3==0))) * (((State_6_4==1)&&(State_7_6==1))||((State_4_8==1)&&(S...172
=> equivalent forward existential formula: [(((FwdU(EY(Init),TRUE) * (((State_6_4==1)&&(State_7_6==1))||((State_4_8==1)&&(State_3_7==1)))) * ((State_2_2==0...230
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,8.73349,163628,1,0,990,385658,1466,346,12717,326597,1461
FORMULA TokenRing-PT-010-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 18:07:03] [INFO ] Invariant cache hit.
[2024-05-29 18:07:03] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-29 18:07:03] [INFO ] Invariant cache hit.
[2024-05-29 18:07:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 18:07:05] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 18:07:05] [INFO ] Invariant cache hit.
[2024-05-29 18:07:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 2 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 2 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 2 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 2 ms to minimize.
[2024-05-29 18:07:14] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-05-29 18:07:14] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
[2024-05-29 18:07:14] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:07:14] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 1 ms to minimize.
[2024-05-29 18:07:14] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 1 ms to minimize.
[2024-05-29 18:07:15] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
[2024-05-29 18:07:15] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:07:15] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 2 ms to minimize.
[2024-05-29 18:07:15] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:07:16] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-29 18:07:18] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 2 ms to minimize.
[2024-05-29 18:07:18] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:07:18] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 18:07:18] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:07:19] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:07:19] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:07:19] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:07:20] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 3 ms to minimize.
[2024-05-29 18:07:20] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:07:20] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 18:07:20] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:07:21] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 2 ms to minimize.
[2024-05-29 18:07:21] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 18:07:21] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:07:22] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:07:22] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:07:29] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:07:29] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:07:30] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 1 ms to minimize.
[2024-05-29 18:07:30] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:07:30] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:07:30] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-05-29 18:07:31] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-29 18:07:31] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:07:31] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:07:32] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2024-05-29 18:07:32] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 2 ms to minimize.
[2024-05-29 18:07:32] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 2 ms to minimize.
[2024-05-29 18:07:32] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:07:33] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-05-29 18:07:33] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 2 ms to minimize.
[2024-05-29 18:07:33] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 18:07:33] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 18:07:34] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2024-05-29 18:07:34] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 18:07:34] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30231 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:07:40] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-05-29 18:07:40] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:07:40] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 3 ms to minimize.
[2024-05-29 18:07:40] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 2 ms to minimize.
[2024-05-29 18:07:41] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:07:41] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 3 ms to minimize.
[2024-05-29 18:07:41] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 3 ms to minimize.
[2024-05-29 18:07:41] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 18:07:42] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 2 ms to minimize.
[2024-05-29 18:07:42] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:07:42] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 2 ms to minimize.
[2024-05-29 18:07:42] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 3 ms to minimize.
[2024-05-29 18:07:43] [INFO ] Deduced a trap composed of 64 places in 296 ms of which 2 ms to minimize.
[2024-05-29 18:07:43] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:07:43] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-05-29 18:07:43] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 18:07:44] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 2 ms to minimize.
[2024-05-29 18:07:44] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 2 ms to minimize.
[2024-05-29 18:07:44] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-05-29 18:07:44] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:07:46] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:07:47] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 2 ms to minimize.
[2024-05-29 18:07:47] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 18:07:47] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-05-29 18:07:47] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-05-29 18:07:47] [INFO ] Deduced a trap composed of 66 places in 218 ms of which 3 ms to minimize.
[2024-05-29 18:07:48] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 3 ms to minimize.
[2024-05-29 18:07:48] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 18:07:48] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 2 ms to minimize.
[2024-05-29 18:07:48] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-05-29 18:07:49] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-05-29 18:07:49] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-05-29 18:07:49] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 2 ms to minimize.
[2024-05-29 18:07:49] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 18:07:50] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 18:07:50] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 18:07:50] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 18:07:50] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 2 ms to minimize.
[2024-05-29 18:07:51] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-05-29 18:07:51] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:07:53] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-05-29 18:07:54] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-29 18:07:54] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-29 18:07:54] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-05-29 18:07:54] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 3 ms to minimize.
[2024-05-29 18:07:55] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-29 18:07:55] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
[2024-05-29 18:07:55] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 3 ms to minimize.
[2024-05-29 18:07:55] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 3 ms to minimize.
[2024-05-29 18:07:56] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:07:56] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 2 ms to minimize.
[2024-05-29 18:07:56] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 2 ms to minimize.
[2024-05-29 18:07:56] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 3 ms to minimize.
[2024-05-29 18:07:57] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 3 ms to minimize.
[2024-05-29 18:07:57] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 18:07:57] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 3 ms to minimize.
[2024-05-29 18:07:58] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 2 ms to minimize.
[2024-05-29 18:07:58] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 3 ms to minimize.
[2024-05-29 18:07:58] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-29 18:07:58] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 18:08:01] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:08:01] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-29 18:08:01] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
[2024-05-29 18:08:02] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:08:02] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 2 ms to minimize.
[2024-05-29 18:08:02] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-05-29 18:08:02] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 2 ms to minimize.
[2024-05-29 18:08:03] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 18:08:03] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 18:08:03] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 18:08:03] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 18:08:04] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 12 ms to minimize.
[2024-05-29 18:08:04] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-05-29 18:08:04] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 18:08:04] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 2 ms to minimize.
[2024-05-29 18:08:04] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-05-29 18:08:05] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 2 ms to minimize.
[2024-05-29 18:08:05] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 1 ms to minimize.
[2024-05-29 18:08:05] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 1 ms to minimize.
[2024-05-29 18:08:05] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30032 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 61159ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61174ms
Finished structural reductions in LTL mode , in 1 iterations and 63023 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 18:08:06] [INFO ] Flatten gal took : 28 ms
[2024-05-29 18:08:06] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:08:06] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 18:08:06] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:08:06] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:08:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16793488138469612038.gal : 6 ms
[2024-05-29 18:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11472706595443448718.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16793488138469612038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11472706595443448718.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.19096,46436,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: (AX(AG(((State_9_0==1)&&(State_10_3==1)))) + A(((!((State_9_5==1)&&(State_8_6==1)))||(!(((State_6_6==1)&&(State_5_4==1))||((State_10_5==1...214
=> equivalent forward existential formula: [(FwdU(EY((Init * !(!((E(!(((State_9_4==1)&&(State_10_8==1))) U (!(((!((State_9_5==1)&&(State_8_6==1)))||(!(((St...366
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,14.1648,283320,1,0,1044,700348,1476,346,12738,500278,1520
FORMULA TokenRing-PT-010-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-29 18:08:21] [INFO ] Flatten gal took : 64 ms
[2024-05-29 18:08:21] [INFO ] Flatten gal took : 63 ms
[2024-05-29 18:08:21] [INFO ] Applying decomposition
[2024-05-29 18:08:21] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15575572920614377135.txt' '-o' '/tmp/graph15575572920614377135.bin' '-w' '/tmp/graph15575572920614377135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15575572920614377135.bin' '-l' '-1' '-v' '-w' '/tmp/graph15575572920614377135.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:08:21] [INFO ] Decomposing Gal with order
[2024-05-29 18:08:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:08:21] [INFO ] Removed a total of 2358 redundant transitions.
[2024-05-29 18:08:21] [INFO ] Flatten gal took : 108 ms
[2024-05-29 18:08:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 11 ms.
[2024-05-29 18:08:21] [INFO ] Time to serialize gal into /tmp/CTLFireability652677832535285666.gal : 8 ms
[2024-05-29 18:08:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3466977763074941079.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability652677832535285666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3466977763074941079.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58905,2.35232,66452,2501,14,108839,206,1524,110087,17,606,0
Converting to forward existential form...Done !
original formula: AF((AG(EF((((((((i2.i9.u5.State_10_7!=1)||(i1.u25.State_0_7!=1))&&((i3.i7.u26.State_0_2!=1)||(i2.i0.u12.State_10_2!=1)))&&(((i2.i7.u45.St...122887
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(E(TRUE U (((((((i2.i9.u5.State_10_7!=1)||(i1.u25.State_0_7!=1))&&((i3.i7.u26.State_0_...122974
Reverse transition relation is NOT exact ! Due to transitions t12, t49, t82, t97, t100, t121, t126, t128, t143, t144, t150, t167, t179, t190, t255, t276, t...2737
(forward)formula 0,1,23.3924,504692,1,0,841276,206,21423,1.82719e+06,69,852,2754373
FORMULA TokenRing-PT-010-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1055720 ms.
BK_STOP 1717006125514
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is TokenRing-PT-010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r422-smll-171690573700162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;