About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?F???T????????T? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264200434.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d1m040, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264200434
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-15
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749078613037
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 23:10:14] [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]
[2025-06-04 23:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 23:10:14] [INFO ] Load time of PNML (sax parser for PT used): 464 ms
[2025-06-04 23:10:14] [INFO ] Transformed 6690 places.
[2025-06-04 23:10:14] [INFO ] Transformed 11934 transitions.
[2025-06-04 23:10:14] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 4305 places in 29 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 56 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1067 places :
Symmetric choice reduction at 1 with 1067 rule applications. Total rules 1186 place count 1301 transition count 10361
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2253 place count 1301 transition count 10361
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 1 with 432 rules applied. Total rules applied 2685 place count 1301 transition count 9929
Discarding 772 places :
Symmetric choice reduction at 2 with 772 rule applications. Total rules 3457 place count 529 transition count 9157
Iterating global reduction 2 with 772 rules applied. Total rules applied 4229 place count 529 transition count 9157
Ensure Unique test removed 6206 transitions
Reduce isomorphic transitions removed 6206 transitions.
Iterating post reduction 2 with 6206 rules applied. Total rules applied 10435 place count 529 transition count 2951
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 10453 place count 511 transition count 2933
Iterating global reduction 3 with 18 rules applied. Total rules applied 10471 place count 511 transition count 2933
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10473 place count 511 transition count 2931
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 10480 place count 504 transition count 2924
Iterating global reduction 4 with 7 rules applied. Total rules applied 10487 place count 504 transition count 2924
Applied a total of 10487 rules in 383 ms. Remains 504 /2385 variables (removed 1881) and now considering 2924/11934 (removed 9010) transitions.
// Phase 1: matrix 2924 rows 504 cols
[2025-06-04 23:10:15] [INFO ] Computed 3 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:10:16] [INFO ] Implicit Places using invariants in 622 ms returned []
[2025-06-04 23:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:10:16] [INFO ] State equation strengthened by 2465 read => feed constraints.
[2025-06-04 23:10:23] [INFO ] Implicit Places using invariants and state equation in 7325 ms returned []
Implicit Place search using SMT with State Equation took 7984 ms to find 0 implicit places.
Running 2923 sub problems to find dead transitions.
[2025-06-04 23:10:23] [INFO ] Invariant cache hit.
[2025-06-04 23:10:23] [INFO ] State equation strengthened by 2465 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/3428 variables, and 1 constraints, problems are : Problem set: 0 solved, 2923 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/504 constraints, ReadFeed: 0/2465 constraints, PredecessorRefiner: 2923/2923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2923 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2923 unsolved
(s413 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/3428 variables, and 1 constraints, problems are : Problem set: 0 solved, 2923 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/504 constraints, ReadFeed: 0/2465 constraints, PredecessorRefiner: 0/2923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68948ms problems are : Problem set: 0 solved, 2923 unsolved
Search for dead transitions found 0 dead transitions in 68977ms
Starting structural reductions in LTL mode, iteration 1 : 504/2385 places, 2924/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77377 ms. Remains : 504/2385 places, 2924/11934 transitions.
Support contains 56 out of 504 places after structural reductions.
[2025-06-04 23:11:32] [INFO ] Flatten gal took : 169 ms
[2025-06-04 23:11:32] [INFO ] Flatten gal took : 122 ms
[2025-06-04 23:11:33] [INFO ] Input system was already deterministic with 2924 transitions.
Reduction of identical properties reduced properties to check from 62 to 61
RANDOM walk for 40000 steps (6701 resets) in 5343 ms. (7 steps per ms) remains 11/61 properties
BEST_FIRST walk for 40002 steps (545 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (270 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (283 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (519 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (494 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (485 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (4983 resets) in 537 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (534 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (520 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (475 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (602 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
[2025-06-04 23:11:35] [INFO ] Invariant cache hit.
[2025-06-04 23:11:35] [INFO ] State equation strengthened by 2465 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 109/130 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/137 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 49/186 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1731/1917 variables, 186/189 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1917 variables, 1272/1461 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1917 variables, 0/1461 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SMT process timed out in 5243ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Graph (complete) has 3844 edges and 504 vertex of which 503 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 503 transition count 2915
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 43 place count 470 transition count 1874
Iterating global reduction 1 with 33 rules applied. Total rules applied 76 place count 470 transition count 1874
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 105 place count 470 transition count 1845
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 249 place count 326 transition count 1701
Iterating global reduction 2 with 144 rules applied. Total rules applied 393 place count 326 transition count 1701
Ensure Unique test removed 653 transitions
Reduce isomorphic transitions removed 653 transitions.
Iterating post reduction 2 with 653 rules applied. Total rules applied 1046 place count 326 transition count 1048
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1102 place count 270 transition count 992
Iterating global reduction 3 with 56 rules applied. Total rules applied 1158 place count 270 transition count 992
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Iterating post reduction 3 with 188 rules applied. Total rules applied 1346 place count 270 transition count 804
Applied a total of 1346 rules in 177 ms. Remains 270 /504 variables (removed 234) and now considering 804/2924 (removed 2120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 270/504 places, 804/2924 transitions.
RANDOM walk for 40000 steps (7026 resets) in 471 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (854 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (516 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (536 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (951 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (922 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (974 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (886 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (917 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (902 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (914 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 263095 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 10
Probabilistic random walk after 263095 steps, saw 118664 distinct states, run finished after 3009 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 804 rows 270 cols
[2025-06-04 23:11:44] [INFO ] Computed 4 invariants in 5 ms
[2025-06-04 23:11:44] [INFO ] State equation strengthened by 560 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 135/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/167 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:44] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 713/880 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 469/641 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/880 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
After SMT solving in domain Real declared 1074/1074 variables, and 744 constraints, problems are : Problem set: 10 solved, 0 unsolved in 1275 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 270/270 constraints, ReadFeed: 469/560 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1336ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 23:11:45] [INFO ] Flatten gal took : 85 ms
[2025-06-04 23:11:45] [INFO ] Flatten gal took : 99 ms
[2025-06-04 23:11:45] [INFO ] Input system was already deterministic with 2924 transitions.
Support contains 48 out of 504 places (down from 51) after GAL structural reductions.
Computed a total of 164 stabilizing places and 1412 stable transitions
Graph (complete) has 3937 edges and 504 vertex of which 503 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 456 transition count 788
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 456 transition count 788
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 456 transition count 781
Discarding 159 places :
Symmetric choice reduction at 1 with 159 rule applications. Total rules 262 place count 297 transition count 622
Iterating global reduction 1 with 159 rules applied. Total rules applied 421 place count 297 transition count 622
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 555 place count 297 transition count 488
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 671 place count 181 transition count 372
Iterating global reduction 2 with 116 rules applied. Total rules applied 787 place count 181 transition count 372
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 883 place count 181 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 885 place count 179 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 887 place count 179 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 888 place count 178 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 889 place count 178 transition count 249
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 893 place count 174 transition count 245
Iterating global reduction 3 with 4 rules applied. Total rules applied 897 place count 174 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 905 place count 174 transition count 237
Applied a total of 905 rules in 48 ms. Remains 174 /504 variables (removed 330) and now considering 237/2924 (removed 2687) transitions.
// Phase 1: matrix 237 rows 174 cols
[2025-06-04 23:11:45] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:11:46] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-04 23:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:11:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-04 23:11:47] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-04 23:11:47] [INFO ] Invariant cache hit.
[2025-06-04 23:11:47] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 5 (OVERLAPS) 237/411 variables, 174/177 constraints. Problems are: Problem set: 24 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 72/249 constraints. Problems are: Problem set: 24 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:57] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:57] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:57] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 4 ms to minimize.
Problem TDEAD177 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:57] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 4 ms to minimize.
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:57] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 5 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:58] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 6 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:58] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:58] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 8 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:58] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:11:58] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 17 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 10/259 constraints. Problems are: Problem set: 40 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:12:01] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 4 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:12:04] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 2/261 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/261 constraints. Problems are: Problem set: 46 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 261 constraints, problems are : Problem set: 46 solved, 190 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 42/174 variables, 2/3 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 12/15 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 237/411 variables, 174/189 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 72/261 constraints. Problems are: Problem set: 46 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 190/451 constraints. Problems are: Problem set: 46 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:12:32] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 1/452 constraints. Problems are: Problem set: 46 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 452 constraints, problems are : Problem set: 46 solved, 190 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 190/236 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 46 solved, 190 unsolved
Search for dead transitions found 46 dead transitions in 60192ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/504 places, 191/2924 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 132 transition count 173
Applied a total of 60 rules in 5 ms. Remains 132 /174 variables (removed 42) and now considering 173/191 (removed 18) transitions.
// Phase 1: matrix 173 rows 132 cols
[2025-06-04 23:12:47] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:12:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 23:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:12:48] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-04 23:12:48] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 132/504 places, 173/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62738 ms. Remains : 132/504 places, 173/2924 transitions.
[2025-06-04 23:12:48] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:12:48] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:12:48] [INFO ] Input system was already deterministic with 173 transitions.
[2025-06-04 23:12:48] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:12:48] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:12:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14797706226064172909.gal : 4 ms
[2025-06-04 23:12:48] [INFO ] Time to serialize properties into /tmp/CTLFireability18099530744410606145.ctl : 3 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14797706226064172909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18099530744410606145.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.95037e+14,11.8072,265508,2,46868,5,1.04516e+06,6,0,701,978407,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 23:13:18] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:13:18] [INFO ] Applying decomposition
[2025-06-04 23:13:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9371079357581732452.txt' '-o' '/tmp/graph9371079357581732452.bin' '-w' '/tmp/graph9371079357581732452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9371079357581732452.bin' '-l' '-1' '-v' '-w' '/tmp/graph9371079357581732452.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:13:19] [INFO ] Decomposing Gal with order
[2025-06-04 23:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:13:19] [INFO ] Removed a total of 176 redundant transitions.
[2025-06-04 23:13:19] [INFO ] Flatten gal took : 204 ms
[2025-06-04 23:13:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 26 ms.
[2025-06-04 23:13:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7001853493083733908.gal : 20 ms
[2025-06-04 23:13:19] [INFO ] Time to serialize properties into /tmp/CTLFireability18006347397455515306.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7001853493083733908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18006347397455515306.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 456 transition count 860
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 456 transition count 860
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 104 place count 456 transition count 852
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 262 place count 298 transition count 694
Iterating global reduction 1 with 158 rules applied. Total rules applied 420 place count 298 transition count 694
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 1 with 170 rules applied. Total rules applied 590 place count 298 transition count 524
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 702 place count 186 transition count 412
Iterating global reduction 2 with 112 rules applied. Total rules applied 814 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 930 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 932 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 934 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 935 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 936 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 937 place count 183 transition count 268
Applied a total of 937 rules in 98 ms. Remains 183 /504 variables (removed 321) and now considering 268/2924 (removed 2656) transitions.
// Phase 1: matrix 268 rows 183 cols
[2025-06-04 23:13:49] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:13:49] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-04 23:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:13:50] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-04 23:13:51] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-04 23:13:51] [INFO ] Invariant cache hit.
[2025-06-04 23:13:51] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 281 constraints, problems are : Problem set: 24 solved, 243 unsolved in 18753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 17/175 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 8/183 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 243/524 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:14:23] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:14:23] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 10 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:14:24] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 5 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:14:29] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 5 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:14:29] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:14:30] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 6/530 constraints. Problems are: Problem set: 46 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 530 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 243/267 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48946ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 48947ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/504 places, 222/2924 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 204
Applied a total of 60 rules in 6 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2025-06-04 23:14:40] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:14:40] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-06-04 23:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:14:41] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 23:14:41] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/504 places, 204/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51995 ms. Remains : 141/504 places, 204/2924 transitions.
[2025-06-04 23:14:41] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:14:41] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:14:41] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-04 23:14:41] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:14:41] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1299606670187639679.gal : 1 ms
[2025-06-04 23:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15997152275517849406.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1299606670187639679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15997152275517849406.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4.61784e+14,9.86594,193716,2,38801,5,882039,6,0,768,818289,0
Converting to forward existential form...Done !
original formula: EX(EX(EF(((s1>=1)&&(l3930>=1)))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * ((s1>=1)&&(l3930>=1)))] != FALSE
(forward)formula 0,1,16.4643,197300,1,0,10,882970,9,1,1971,823749,5
FORMULA RingSingleMessageInMbox-PT-d1m040-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 458 transition count 934
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 458 transition count 934
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 103 place count 458 transition count 923
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 259 place count 302 transition count 767
Iterating global reduction 1 with 156 rules applied. Total rules applied 415 place count 302 transition count 767
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 616 place count 302 transition count 566
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 724 place count 194 transition count 458
Iterating global reduction 2 with 108 rules applied. Total rules applied 832 place count 194 transition count 458
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 968 place count 194 transition count 322
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 969 place count 193 transition count 309
Iterating global reduction 3 with 1 rules applied. Total rules applied 970 place count 193 transition count 309
Applied a total of 970 rules in 55 ms. Remains 193 /504 variables (removed 311) and now considering 309/2924 (removed 2615) transitions.
// Phase 1: matrix 309 rows 193 cols
[2025-06-04 23:14:58] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:14:58] [INFO ] Implicit Places using invariants in 308 ms returned []
[2025-06-04 23:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:14:58] [INFO ] State equation strengthened by 128 read => feed constraints.
[2025-06-04 23:15:00] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:15:00] [INFO ] Redundant transitions in 16 ms returned []
Running 308 sub problems to find dead transitions.
[2025-06-04 23:15:00] [INFO ] Invariant cache hit.
[2025-06-04 23:15:00] [INFO ] State equation strengthened by 128 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 4 (OVERLAPS) 309/502 variables, 193/196 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 128/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 324 constraints, problems are : Problem set: 24 solved, 284 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 193/193 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 17/185 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 8/193 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 309/502 variables, 193/196 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 128/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 284/608 constraints. Problems are: Problem set: 24 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:15:56] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:15:57] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 4 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 610 constraints, problems are : Problem set: 36 solved, 272 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 193/193 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 284/308 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 36 solved, 272 unsolved
Search for dead transitions found 36 dead transitions in 60240ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 193/504 places, 273/2924 transitions.
Graph (complete) has 638 edges and 193 vertex of which 161 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 161 transition count 261
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 157 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 157 transition count 257
Applied a total of 21 rules in 13 ms. Remains 157 /193 variables (removed 36) and now considering 257/273 (removed 16) transitions.
// Phase 1: matrix 257 rows 157 cols
[2025-06-04 23:16:00] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:16:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-04 23:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:16:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-04 23:16:01] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 157/504 places, 257/2924 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63237 ms. Remains : 157/504 places, 257/2924 transitions.
[2025-06-04 23:16:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:16:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:16:01] [INFO ] Input system was already deterministic with 257 transitions.
[2025-06-04 23:16:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:16:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:16:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9478741121705477364.gal : 1 ms
[2025-06-04 23:16:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16615811157772043970.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9478741121705477364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16615811157772043970.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4.38352e+14,24.2506,527632,2,62951,5,1.74249e+06,6,0,885,1.61268e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 23:16:31] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:16:31] [INFO ] Applying decomposition
[2025-06-04 23:16:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph844187185989930202.txt' '-o' '/tmp/graph844187185989930202.bin' '-w' '/tmp/graph844187185989930202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph844187185989930202.bin' '-l' '-1' '-v' '-w' '/tmp/graph844187185989930202.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:16:31] [INFO ] Decomposing Gal with order
[2025-06-04 23:16:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:16:31] [INFO ] Removed a total of 263 redundant transitions.
[2025-06-04 23:16:31] [INFO ] Flatten gal took : 55 ms
[2025-06-04 23:16:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 9 ms.
[2025-06-04 23:16:31] [INFO ] Time to serialize gal into /tmp/CTLFireability601101975313511004.gal : 7 ms
[2025-06-04 23:16:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7213393153510437791.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability601101975313511004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7213393153510437791.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 458 transition count 1006
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 458 transition count 1006
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 100 place count 458 transition count 998
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 256 place count 302 transition count 842
Iterating global reduction 1 with 156 rules applied. Total rules applied 412 place count 302 transition count 842
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 654 place count 302 transition count 600
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 758 place count 198 transition count 496
Iterating global reduction 2 with 104 rules applied. Total rules applied 862 place count 198 transition count 496
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 1018 place count 198 transition count 340
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1019 place count 197 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 1020 place count 197 transition count 327
Applied a total of 1020 rules in 23 ms. Remains 197 /504 variables (removed 307) and now considering 327/2924 (removed 2597) transitions.
// Phase 1: matrix 327 rows 197 cols
[2025-06-04 23:17:01] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:17:01] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-04 23:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:17:02] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-04 23:17:03] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2025-06-04 23:17:03] [INFO ] Invariant cache hit.
[2025-06-04 23:17:03] [INFO ] State equation strengthened by 143 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 4 (OVERLAPS) 327/524 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 143/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 343 constraints, problems are : Problem set: 24 solved, 302 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 17/189 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 8/197 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 327/524 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 143/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 302/645 constraints. Problems are: Problem set: 24 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:18:03] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:18:03] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 647 constraints, problems are : Problem set: 24 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 302/326 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60256ms problems are : Problem set: 24 solved, 302 unsolved
Search for dead transitions found 24 dead transitions in 60257ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/504 places, 303/2924 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 173 transition count 291
Applied a total of 36 rules in 14 ms. Remains 173 /197 variables (removed 24) and now considering 291/303 (removed 12) transitions.
// Phase 1: matrix 291 rows 173 cols
[2025-06-04 23:18:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:18:04] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-06-04 23:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:18:04] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-04 23:18:05] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 173/504 places, 291/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63824 ms. Remains : 173/504 places, 291/2924 transitions.
[2025-06-04 23:18:05] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:18:05] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:18:05] [INFO ] Input system was already deterministic with 291 transitions.
[2025-06-04 23:18:05] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:18:05] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:18:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6052250654041475516.gal : 1 ms
[2025-06-04 23:18:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13528113900652150052.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6052250654041475516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13528113900652150052.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.01796e+14,18.7137,398568,2,59735,5,1.37958e+06,6,0,983,1.41133e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 23:18:35] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:18:35] [INFO ] Applying decomposition
[2025-06-04 23:18:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15037401161866047181.txt' '-o' '/tmp/graph15037401161866047181.bin' '-w' '/tmp/graph15037401161866047181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15037401161866047181.bin' '-l' '-1' '-v' '-w' '/tmp/graph15037401161866047181.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:18:35] [INFO ] Decomposing Gal with order
[2025-06-04 23:18:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:18:35] [INFO ] Removed a total of 283 redundant transitions.
[2025-06-04 23:18:35] [INFO ] Flatten gal took : 36 ms
[2025-06-04 23:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 21 ms.
[2025-06-04 23:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11937744743422265548.gal : 3 ms
[2025-06-04 23:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3844172434824578510.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11937744743422265548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3844172434824578510.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 462 transition count 1154
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 462 transition count 1154
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 104 place count 462 transition count 1134
Discarding 122 places :
Symmetric choice reduction at 1 with 122 rule applications. Total rules 226 place count 340 transition count 1012
Iterating global reduction 1 with 122 rules applied. Total rules applied 348 place count 340 transition count 1012
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 1 with 228 rules applied. Total rules applied 576 place count 340 transition count 784
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 696 place count 220 transition count 664
Iterating global reduction 2 with 120 rules applied. Total rules applied 816 place count 220 transition count 664
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 2 with 220 rules applied. Total rules applied 1036 place count 220 transition count 444
Applied a total of 1036 rules in 25 ms. Remains 220 /504 variables (removed 284) and now considering 444/2924 (removed 2480) transitions.
// Phase 1: matrix 444 rows 220 cols
[2025-06-04 23:19:05] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:19:06] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-04 23:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:19:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-04 23:19:08] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3035 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2025-06-04 23:19:08] [INFO ] Invariant cache hit.
[2025-06-04 23:19:08] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/220 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 5 (OVERLAPS) 444/664 variables, 220/223 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 241/464 constraints. Problems are: Problem set: 24 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 464 constraints, problems are : Problem set: 24 solved, 419 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 220/220 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 24/220 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 444/664 variables, 220/223 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 241/464 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 419/883 constraints. Problems are: Problem set: 24 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 883 constraints, problems are : Problem set: 24 solved, 419 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 220/220 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 419/443 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 24 solved, 419 unsolved
Search for dead transitions found 24 dead transitions in 60411ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 220/504 places, 420/2924 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 196 transition count 408
Applied a total of 36 rules in 3 ms. Remains 196 /220 variables (removed 24) and now considering 408/420 (removed 12) transitions.
// Phase 1: matrix 408 rows 196 cols
[2025-06-04 23:20:09] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:20:09] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-04 23:20:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:20:09] [INFO ] State equation strengthened by 237 read => feed constraints.
[2025-06-04 23:20:11] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 196/504 places, 408/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65612 ms. Remains : 196/504 places, 408/2924 transitions.
[2025-06-04 23:20:11] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:20:11] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:20:11] [INFO ] Input system was already deterministic with 408 transitions.
[2025-06-04 23:20:11] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:20:11] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:20:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14820700166862457564.gal : 2 ms
[2025-06-04 23:20:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8056484908163826918.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14820700166862457564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8056484908163826918.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:20:41] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:20:41] [INFO ] Applying decomposition
[2025-06-04 23:20:41] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8833928233612877541.txt' '-o' '/tmp/graph8833928233612877541.bin' '-w' '/tmp/graph8833928233612877541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8833928233612877541.bin' '-l' '-1' '-v' '-w' '/tmp/graph8833928233612877541.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:20:41] [INFO ] Decomposing Gal with order
[2025-06-04 23:20:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:20:41] [INFO ] Removed a total of 568 redundant transitions.
[2025-06-04 23:20:41] [INFO ] Flatten gal took : 40 ms
[2025-06-04 23:20:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 293 labels/synchronizations in 10 ms.
[2025-06-04 23:20:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12093038374497441900.gal : 3 ms
[2025-06-04 23:20:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9903901062071657875.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12093038374497441900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9903901062071657875.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 456 transition count 788
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 456 transition count 788
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 456 transition count 781
Discarding 159 places :
Symmetric choice reduction at 1 with 159 rule applications. Total rules 262 place count 297 transition count 622
Iterating global reduction 1 with 159 rules applied. Total rules applied 421 place count 297 transition count 622
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 555 place count 297 transition count 488
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 671 place count 181 transition count 372
Iterating global reduction 2 with 116 rules applied. Total rules applied 787 place count 181 transition count 372
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 883 place count 181 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 885 place count 179 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 887 place count 179 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 888 place count 178 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 889 place count 178 transition count 249
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 893 place count 174 transition count 245
Iterating global reduction 3 with 4 rules applied. Total rules applied 897 place count 174 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 905 place count 174 transition count 237
Applied a total of 905 rules in 45 ms. Remains 174 /504 variables (removed 330) and now considering 237/2924 (removed 2687) transitions.
// Phase 1: matrix 237 rows 174 cols
[2025-06-04 23:21:11] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:21:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-04 23:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:21:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-04 23:21:13] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:21:13] [INFO ] Redundant transitions in 2 ms returned []
Running 236 sub problems to find dead transitions.
[2025-06-04 23:21:13] [INFO ] Invariant cache hit.
[2025-06-04 23:21:13] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 5 (OVERLAPS) 237/411 variables, 174/177 constraints. Problems are: Problem set: 24 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 72/249 constraints. Problems are: Problem set: 24 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/249 constraints. Problems are: Problem set: 24 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:21:25] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:21:25] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/411 variables, 2/251 constraints. Problems are: Problem set: 44 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:21:30] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:21:30] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 4 ms to minimize.
Problem TDEAD180 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 2/253 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/253 constraints. Problems are: Problem set: 45 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 253 constraints, problems are : Problem set: 45 solved, 191 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 41/174 variables, 2/3 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 4/7 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 237/411 variables, 174/181 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 72/253 constraints. Problems are: Problem set: 45 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 191/444 constraints. Problems are: Problem set: 45 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:22:00] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:22:08] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 5 ms to minimize.
Problem TDEAD184 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:22:09] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 3/447 constraints. Problems are: Problem set: 46 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 447 constraints, problems are : Problem set: 46 solved, 190 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 191/236 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 46 solved, 190 unsolved
Search for dead transitions found 46 dead transitions in 60146ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 174/504 places, 191/2924 transitions.
Graph (complete) has 501 edges and 174 vertex of which 132 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 132 transition count 173
Applied a total of 19 rules in 7 ms. Remains 132 /174 variables (removed 42) and now considering 173/191 (removed 18) transitions.
// Phase 1: matrix 173 rows 132 cols
[2025-06-04 23:22:13] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:22:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-04 23:22:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:22:13] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-04 23:22:14] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 132/504 places, 173/2924 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62189 ms. Remains : 132/504 places, 173/2924 transitions.
[2025-06-04 23:22:14] [INFO ] Flatten gal took : 4 ms
[2025-06-04 23:22:14] [INFO ] Flatten gal took : 4 ms
[2025-06-04 23:22:14] [INFO ] Input system was already deterministic with 173 transitions.
[2025-06-04 23:22:14] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:22:14] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:22:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1979730987608508801.gal : 2 ms
[2025-06-04 23:22:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11293185722462355203.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1979730987608508801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11293185722462355203.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.95037e+14,13.7754,313728,2,47351,5,1.12026e+06,6,0,701,1.03737e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 23:22:44] [INFO ] Flatten gal took : 4 ms
[2025-06-04 23:22:44] [INFO ] Applying decomposition
[2025-06-04 23:22:44] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3081832327773183765.txt' '-o' '/tmp/graph3081832327773183765.bin' '-w' '/tmp/graph3081832327773183765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3081832327773183765.bin' '-l' '-1' '-v' '-w' '/tmp/graph3081832327773183765.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:22:44] [INFO ] Decomposing Gal with order
[2025-06-04 23:22:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:22:44] [INFO ] Removed a total of 168 redundant transitions.
[2025-06-04 23:22:44] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:22:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 4 ms.
[2025-06-04 23:22:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10984024521493014444.gal : 2 ms
[2025-06-04 23:22:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10349059215109139207.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10984024521493014444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10349059215109139207.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 458 transition count 934
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 458 transition count 934
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 100 place count 458 transition count 926
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 226 place count 332 transition count 800
Iterating global reduction 1 with 126 rules applied. Total rules applied 352 place count 332 transition count 800
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 1 with 158 rules applied. Total rules applied 510 place count 332 transition count 642
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 645 place count 197 transition count 507
Iterating global reduction 2 with 135 rules applied. Total rules applied 780 place count 197 transition count 507
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 2 with 170 rules applied. Total rules applied 950 place count 197 transition count 337
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 952 place count 195 transition count 307
Iterating global reduction 3 with 2 rules applied. Total rules applied 954 place count 195 transition count 307
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 955 place count 194 transition count 306
Iterating global reduction 3 with 1 rules applied. Total rules applied 956 place count 194 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 957 place count 194 transition count 305
Applied a total of 957 rules in 31 ms. Remains 194 /504 variables (removed 310) and now considering 305/2924 (removed 2619) transitions.
// Phase 1: matrix 305 rows 194 cols
[2025-06-04 23:23:14] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:23:14] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-04 23:23:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:23:14] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-06-04 23:23:16] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-04 23:23:16] [INFO ] Invariant cache hit.
[2025-06-04 23:23:16] [INFO ] State equation strengthened by 123 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 4 (OVERLAPS) 305/499 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 123/320 constraints. Problems are: Problem set: 24 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/320 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/320 constraints. Problems are: Problem set: 24 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 320 constraints, problems are : Problem set: 24 solved, 280 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 17/186 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 8/194 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 305/499 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 123/320 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 280/600 constraints. Problems are: Problem set: 24 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:24:05] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:24:05] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 4 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:24:06] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 6 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:24:11] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 5 ms to minimize.
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:24:12] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:24:12] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 6/606 constraints. Problems are: Problem set: 46 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 606 constraints, problems are : Problem set: 46 solved, 258 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 280/304 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 46 solved, 258 unsolved
Search for dead transitions found 46 dead transitions in 60232ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 194/504 places, 259/2924 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 152 transition count 241
Applied a total of 60 rules in 5 ms. Remains 152 /194 variables (removed 42) and now considering 241/259 (removed 18) transitions.
// Phase 1: matrix 241 rows 152 cols
[2025-06-04 23:24:16] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:24:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 23:24:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:24:16] [INFO ] State equation strengthened by 115 read => feed constraints.
[2025-06-04 23:24:17] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/504 places, 241/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63397 ms. Remains : 152/504 places, 241/2924 transitions.
[2025-06-04 23:24:17] [INFO ] Flatten gal took : 4 ms
[2025-06-04 23:24:17] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:24:17] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-04 23:24:17] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:24:17] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11041021282805176595.gal : 1 ms
[2025-06-04 23:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9471327898454110356.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11041021282805176595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9471327898454110356.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.9767e+15,14.3227,324612,2,50149,5,1.19138e+06,6,0,849,1.12824e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 23:24:47] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:24:47] [INFO ] Applying decomposition
[2025-06-04 23:24:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16070667180614700726.txt' '-o' '/tmp/graph16070667180614700726.bin' '-w' '/tmp/graph16070667180614700726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16070667180614700726.bin' '-l' '-1' '-v' '-w' '/tmp/graph16070667180614700726.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:24:47] [INFO ] Decomposing Gal with order
[2025-06-04 23:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:24:47] [INFO ] Removed a total of 257 redundant transitions.
[2025-06-04 23:24:47] [INFO ] Flatten gal took : 14 ms
[2025-06-04 23:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 3 ms.
[2025-06-04 23:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5709655741611948803.gal : 18 ms
[2025-06-04 23:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8114261831527630124.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5709655741611948803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8114261831527630124.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 461 transition count 1225
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 461 transition count 1225
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 106 place count 461 transition count 1205
Discarding 153 places :
Symmetric choice reduction at 1 with 153 rule applications. Total rules 259 place count 308 transition count 1052
Iterating global reduction 1 with 153 rules applied. Total rules applied 412 place count 308 transition count 1052
Ensure Unique test removed 338 transitions
Reduce isomorphic transitions removed 338 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 750 place count 308 transition count 714
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 842 place count 216 transition count 622
Iterating global reduction 2 with 92 rules applied. Total rules applied 934 place count 216 transition count 622
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 1102 place count 216 transition count 454
Applied a total of 1102 rules in 20 ms. Remains 216 /504 variables (removed 288) and now considering 454/2924 (removed 2470) transitions.
// Phase 1: matrix 454 rows 216 cols
[2025-06-04 23:25:17] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:25:18] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-04 23:25:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:25:18] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-04 23:25:22] [INFO ] Implicit Places using invariants and state equation in 4156 ms returned []
Implicit Place search using SMT with State Equation took 4331 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-06-04 23:25:22] [INFO ] Invariant cache hit.
[2025-06-04 23:25:22] [INFO ] State equation strengthened by 255 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 4 (OVERLAPS) 454/670 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 255/474 constraints. Problems are: Problem set: 24 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/670 variables, and 474 constraints, problems are : Problem set: 24 solved, 429 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 17/208 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 8/216 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 454/670 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 255/474 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 429/903 constraints. Problems are: Problem set: 24 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 903 constraints, problems are : Problem set: 24 solved, 429 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 429/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 24 solved, 429 unsolved
Search for dead transitions found 24 dead transitions in 60397ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/504 places, 430/2924 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 418
Applied a total of 36 rules in 2 ms. Remains 192 /216 variables (removed 24) and now considering 418/430 (removed 12) transitions.
// Phase 1: matrix 418 rows 192 cols
[2025-06-04 23:26:22] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:26:22] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-04 23:26:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:26:22] [INFO ] State equation strengthened by 251 read => feed constraints.
[2025-06-04 23:26:27] [INFO ] Implicit Places using invariants and state equation in 4684 ms returned []
Implicit Place search using SMT with State Equation took 4787 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 192/504 places, 418/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69539 ms. Remains : 192/504 places, 418/2924 transitions.
[2025-06-04 23:26:27] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:26:27] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:26:27] [INFO ] Input system was already deterministic with 418 transitions.
[2025-06-04 23:26:27] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:26:27] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:26:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16622814792457509885.gal : 1 ms
[2025-06-04 23:26:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5650064540923098940.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16622814792457509885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5650064540923098940.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:26:57] [INFO ] Flatten gal took : 12 ms
[2025-06-04 23:26:57] [INFO ] Applying decomposition
[2025-06-04 23:26:57] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17428336714498235884.txt' '-o' '/tmp/graph17428336714498235884.bin' '-w' '/tmp/graph17428336714498235884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17428336714498235884.bin' '-l' '-1' '-v' '-w' '/tmp/graph17428336714498235884.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:26:57] [INFO ] Decomposing Gal with order
[2025-06-04 23:26:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:26:57] [INFO ] Removed a total of 359 redundant transitions.
[2025-06-04 23:26:57] [INFO ] Flatten gal took : 31 ms
[2025-06-04 23:26:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 197 labels/synchronizations in 3 ms.
[2025-06-04 23:26:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14038615291241431135.gal : 3 ms
[2025-06-04 23:26:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4111530305095152797.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14038615291241431135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4111530305095152797.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 465 transition count 1301
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 465 transition count 1301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 91 place count 465 transition count 1288
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 211 place count 345 transition count 1168
Iterating global reduction 1 with 120 rules applied. Total rules applied 331 place count 345 transition count 1168
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 1 with 286 rules applied. Total rules applied 617 place count 345 transition count 882
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 727 place count 235 transition count 772
Iterating global reduction 2 with 110 rules applied. Total rules applied 837 place count 235 transition count 772
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Iterating post reduction 2 with 225 rules applied. Total rules applied 1062 place count 235 transition count 547
Applied a total of 1062 rules in 57 ms. Remains 235 /504 variables (removed 269) and now considering 547/2924 (removed 2377) transitions.
// Phase 1: matrix 547 rows 235 cols
[2025-06-04 23:27:27] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:27:27] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-04 23:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:27:28] [INFO ] State equation strengthened by 331 read => feed constraints.
[2025-06-04 23:27:29] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:27:29] [INFO ] Redundant transitions in 12 ms returned []
Running 546 sub problems to find dead transitions.
[2025-06-04 23:27:29] [INFO ] Invariant cache hit.
[2025-06-04 23:27:29] [INFO ] State equation strengthened by 331 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
At refinement iteration 4 (OVERLAPS) 547/782 variables, 235/238 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 331/569 constraints. Problems are: Problem set: 24 solved, 522 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/782 variables, and 569 constraints, problems are : Problem set: 24 solved, 522 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, ReadFeed: 331/331 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 522 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 17/227 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 8/235 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 547/782 variables, 235/238 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 331/569 constraints. Problems are: Problem set: 24 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 522/1091 constraints. Problems are: Problem set: 24 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/782 variables, and 1091 constraints, problems are : Problem set: 24 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, ReadFeed: 331/331 constraints, PredecessorRefiner: 522/546 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60560ms problems are : Problem set: 24 solved, 522 unsolved
Search for dead transitions found 24 dead transitions in 60562ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 235/504 places, 523/2924 transitions.
Graph (complete) has 977 edges and 235 vertex of which 211 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 211 transition count 511
Applied a total of 13 rules in 21 ms. Remains 211 /235 variables (removed 24) and now considering 511/523 (removed 12) transitions.
// Phase 1: matrix 511 rows 211 cols
[2025-06-04 23:28:29] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:28:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-04 23:28:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:28:30] [INFO ] State equation strengthened by 327 read => feed constraints.
[2025-06-04 23:28:34] [INFO ] Implicit Places using invariants and state equation in 4123 ms returned []
Implicit Place search using SMT with State Equation took 4261 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 211/504 places, 511/2924 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 66531 ms. Remains : 211/504 places, 511/2924 transitions.
[2025-06-04 23:28:34] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:28:34] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:28:34] [INFO ] Input system was already deterministic with 511 transitions.
[2025-06-04 23:28:34] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:28:34] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:28:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17563642075174167108.gal : 2 ms
[2025-06-04 23:28:34] [INFO ] Time to serialize properties into /tmp/CTLFireability963553754563030174.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17563642075174167108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability963553754563030174.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:29:04] [INFO ] Flatten gal took : 16 ms
[2025-06-04 23:29:04] [INFO ] Applying decomposition
[2025-06-04 23:29:04] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8176118508884744734.txt' '-o' '/tmp/graph8176118508884744734.bin' '-w' '/tmp/graph8176118508884744734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8176118508884744734.bin' '-l' '-1' '-v' '-w' '/tmp/graph8176118508884744734.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:29:04] [INFO ] Decomposing Gal with order
[2025-06-04 23:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:29:04] [INFO ] Removed a total of 526 redundant transitions.
[2025-06-04 23:29:04] [INFO ] Flatten gal took : 69 ms
[2025-06-04 23:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 5 ms.
[2025-06-04 23:29:04] [INFO ] Time to serialize gal into /tmp/CTLFireability427639238245296344.gal : 2 ms
[2025-06-04 23:29:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5315758530049624920.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability427639238245296344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5315758530049624920.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 461 transition count 1225
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 461 transition count 1225
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 103 place count 461 transition count 1208
Discarding 153 places :
Symmetric choice reduction at 1 with 153 rule applications. Total rules 256 place count 308 transition count 1055
Iterating global reduction 1 with 153 rules applied. Total rules applied 409 place count 308 transition count 1055
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Iterating post reduction 1 with 341 rules applied. Total rules applied 750 place count 308 transition count 714
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 842 place count 216 transition count 622
Iterating global reduction 2 with 92 rules applied. Total rules applied 934 place count 216 transition count 622
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 1102 place count 216 transition count 454
Applied a total of 1102 rules in 41 ms. Remains 216 /504 variables (removed 288) and now considering 454/2924 (removed 2470) transitions.
// Phase 1: matrix 454 rows 216 cols
[2025-06-04 23:29:34] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:29:34] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-04 23:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:29:34] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-04 23:29:36] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:29:36] [INFO ] Redundant transitions in 6 ms returned []
Running 453 sub problems to find dead transitions.
[2025-06-04 23:29:36] [INFO ] Invariant cache hit.
[2025-06-04 23:29:36] [INFO ] State equation strengthened by 255 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 4 (OVERLAPS) 454/670 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 255/474 constraints. Problems are: Problem set: 24 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/670 variables, and 474 constraints, problems are : Problem set: 24 solved, 429 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 17/208 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 8/216 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 454/670 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 255/474 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 429/903 constraints. Problems are: Problem set: 24 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 903 constraints, problems are : Problem set: 24 solved, 429 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 429/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60538ms problems are : Problem set: 24 solved, 429 unsolved
Search for dead transitions found 24 dead transitions in 60541ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 216/504 places, 430/2924 transitions.
Graph (complete) has 847 edges and 216 vertex of which 192 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 192 transition count 418
Applied a total of 13 rules in 15 ms. Remains 192 /216 variables (removed 24) and now considering 418/430 (removed 12) transitions.
// Phase 1: matrix 418 rows 192 cols
[2025-06-04 23:30:37] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:30:37] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-04 23:30:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:30:37] [INFO ] State equation strengthened by 251 read => feed constraints.
[2025-06-04 23:30:39] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 192/504 places, 418/2924 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64667 ms. Remains : 192/504 places, 418/2924 transitions.
[2025-06-04 23:30:39] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:30:39] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:30:39] [INFO ] Input system was already deterministic with 418 transitions.
[2025-06-04 23:30:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:30:39] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:30:39] [INFO ] Time to serialize gal into /tmp/CTLFireability1636441530248742928.gal : 2 ms
[2025-06-04 23:30:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4985107599213415841.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1636441530248742928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4985107599213415841.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:31:09] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:31:09] [INFO ] Applying decomposition
[2025-06-04 23:31:09] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13535772683797097791.txt' '-o' '/tmp/graph13535772683797097791.bin' '-w' '/tmp/graph13535772683797097791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13535772683797097791.bin' '-l' '-1' '-v' '-w' '/tmp/graph13535772683797097791.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:31:09] [INFO ] Decomposing Gal with order
[2025-06-04 23:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:31:09] [INFO ] Removed a total of 337 redundant transitions.
[2025-06-04 23:31:09] [INFO ] Flatten gal took : 18 ms
[2025-06-04 23:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 4 ms.
[2025-06-04 23:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12635398543482128751.gal : 3 ms
[2025-06-04 23:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16192781956919589978.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12635398543482128751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16192781956919589978.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 457 transition count 933
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 457 transition count 933
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 102 place count 457 transition count 925
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 259 place count 300 transition count 768
Iterating global reduction 1 with 157 rules applied. Total rules applied 416 place count 300 transition count 768
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 622 place count 300 transition count 562
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 730 place count 192 transition count 454
Iterating global reduction 2 with 108 rules applied. Total rules applied 838 place count 192 transition count 454
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 966 place count 192 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 967 place count 191 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 968 place count 191 transition count 313
Applied a total of 968 rules in 51 ms. Remains 191 /504 variables (removed 313) and now considering 313/2924 (removed 2611) transitions.
// Phase 1: matrix 313 rows 191 cols
[2025-06-04 23:31:39] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:31:39] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-04 23:31:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:31:39] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-04 23:31:42] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:31:42] [INFO ] Redundant transitions in 1 ms returned []
Running 312 sub problems to find dead transitions.
[2025-06-04 23:31:42] [INFO ] Invariant cache hit.
[2025-06-04 23:31:42] [INFO ] State equation strengthened by 134 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
At refinement iteration 4 (OVERLAPS) 313/504 variables, 191/194 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 134/328 constraints. Problems are: Problem set: 24 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/328 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/328 constraints. Problems are: Problem set: 24 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 328 constraints, problems are : Problem set: 24 solved, 288 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 17/183 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 8/191 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 313/504 variables, 191/194 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 134/328 constraints. Problems are: Problem set: 24 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 288/616 constraints. Problems are: Problem set: 24 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:32:38] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:32:38] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:32:38] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:32:38] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 9 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 620 constraints, problems are : Problem set: 28 solved, 284 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 288/312 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 28 solved, 284 unsolved
Search for dead transitions found 28 dead transitions in 60231ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 191/504 places, 285/2924 transitions.
Graph (complete) has 656 edges and 191 vertex of which 165 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 165 transition count 273
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 164 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 164 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 162 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 162 transition count 270
Applied a total of 19 rules in 10 ms. Remains 162 /191 variables (removed 29) and now considering 270/285 (removed 15) transitions.
// Phase 1: matrix 270 rows 162 cols
[2025-06-04 23:32:42] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:32:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-04 23:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:32:42] [INFO ] State equation strengthened by 129 read => feed constraints.
[2025-06-04 23:32:43] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 162/504 places, 270/2924 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63899 ms. Remains : 162/504 places, 270/2924 transitions.
[2025-06-04 23:32:43] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:32:43] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:32:43] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-04 23:32:43] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:32:43] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:32:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3658426182626801925.gal : 1 ms
[2025-06-04 23:32:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8441855892573073950.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3658426182626801925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8441855892573073950.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4.68423e+14,12.1787,274240,2,48591,5,1.14998e+06,6,0,918,1.10474e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 23:33:13] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:33:13] [INFO ] Applying decomposition
[2025-06-04 23:33:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14556745268701369591.txt' '-o' '/tmp/graph14556745268701369591.bin' '-w' '/tmp/graph14556745268701369591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14556745268701369591.bin' '-l' '-1' '-v' '-w' '/tmp/graph14556745268701369591.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:33:13] [INFO ] Decomposing Gal with order
[2025-06-04 23:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:33:13] [INFO ] Removed a total of 248 redundant transitions.
[2025-06-04 23:33:13] [INFO ] Flatten gal took : 25 ms
[2025-06-04 23:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 23 ms.
[2025-06-04 23:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10024686511428637532.gal : 1 ms
[2025-06-04 23:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3983726624954909846.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10024686511428637532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3983726624954909846.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 473 transition count 1741
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 473 transition count 1741
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 88 place count 473 transition count 1715
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 200 place count 361 transition count 1603
Iterating global reduction 1 with 112 rules applied. Total rules applied 312 place count 361 transition count 1603
Ensure Unique test removed 413 transitions
Reduce isomorphic transitions removed 413 transitions.
Iterating post reduction 1 with 413 rules applied. Total rules applied 725 place count 361 transition count 1190
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 805 place count 281 transition count 1110
Iterating global reduction 2 with 80 rules applied. Total rules applied 885 place count 281 transition count 1110
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Iterating post reduction 2 with 270 rules applied. Total rules applied 1155 place count 281 transition count 840
Applied a total of 1155 rules in 27 ms. Remains 281 /504 variables (removed 223) and now considering 840/2924 (removed 2084) transitions.
// Phase 1: matrix 840 rows 281 cols
[2025-06-04 23:33:43] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:33:43] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-04 23:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:33:44] [INFO ] State equation strengthened by 584 read => feed constraints.
[2025-06-04 23:33:45] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Running 839 sub problems to find dead transitions.
[2025-06-04 23:33:45] [INFO ] Invariant cache hit.
[2025-06-04 23:33:45] [INFO ] State equation strengthened by 584 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 2 (OVERLAPS) 1/281 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
At refinement iteration 4 (OVERLAPS) 840/1121 variables, 281/284 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1121 variables, 584/868 constraints. Problems are: Problem set: 24 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1121/1121 variables, and 868 constraints, problems are : Problem set: 24 solved, 815 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 281/281 constraints, ReadFeed: 584/584 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 815 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 1 (OVERLAPS) 17/273 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 3 (OVERLAPS) 8/281 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 5 (OVERLAPS) 840/1121 variables, 281/284 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1121 variables, 584/868 constraints. Problems are: Problem set: 24 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1121/1121 variables, and 1683 constraints, problems are : Problem set: 24 solved, 815 unsolved in 30558 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 281/281 constraints, ReadFeed: 584/584 constraints, PredecessorRefiner: 815/839 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61535ms problems are : Problem set: 24 solved, 815 unsolved
Search for dead transitions found 24 dead transitions in 61537ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 281/504 places, 816/2924 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 257 transition count 804
Applied a total of 36 rules in 4 ms. Remains 257 /281 variables (removed 24) and now considering 804/816 (removed 12) transitions.
// Phase 1: matrix 804 rows 257 cols
[2025-06-04 23:34:47] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:34:47] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-04 23:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:34:47] [INFO ] State equation strengthened by 580 read => feed constraints.
[2025-06-04 23:34:49] [INFO ] Implicit Places using invariants and state equation in 2062 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/504 places, 804/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65807 ms. Remains : 257/504 places, 804/2924 transitions.
[2025-06-04 23:34:49] [INFO ] Flatten gal took : 16 ms
[2025-06-04 23:34:49] [INFO ] Flatten gal took : 17 ms
[2025-06-04 23:34:49] [INFO ] Input system was already deterministic with 804 transitions.
[2025-06-04 23:34:49] [INFO ] Flatten gal took : 16 ms
[2025-06-04 23:34:49] [INFO ] Flatten gal took : 17 ms
[2025-06-04 23:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9607261687569778791.gal : 3 ms
[2025-06-04 23:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8357488191773769970.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9607261687569778791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8357488191773769970.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:35:19] [INFO ] Flatten gal took : 16 ms
[2025-06-04 23:35:19] [INFO ] Applying decomposition
[2025-06-04 23:35:19] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16662642307095953032.txt' '-o' '/tmp/graph16662642307095953032.bin' '-w' '/tmp/graph16662642307095953032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16662642307095953032.bin' '-l' '-1' '-v' '-w' '/tmp/graph16662642307095953032.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:35:19] [INFO ] Decomposing Gal with order
[2025-06-04 23:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:35:19] [INFO ] Removed a total of 611 redundant transitions.
[2025-06-04 23:35:19] [INFO ] Flatten gal took : 37 ms
[2025-06-04 23:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 452 labels/synchronizations in 6 ms.
[2025-06-04 23:35:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16437107516137032563.gal : 3 ms
[2025-06-04 23:35:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9259771397391750114.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16437107516137032563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9259771397391750114.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 458 transition count 1006
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 458 transition count 1006
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 106 place count 458 transition count 992
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 262 place count 302 transition count 836
Iterating global reduction 1 with 156 rules applied. Total rules applied 418 place count 302 transition count 836
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 1 with 236 rules applied. Total rules applied 654 place count 302 transition count 600
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 758 place count 198 transition count 496
Iterating global reduction 2 with 104 rules applied. Total rules applied 862 place count 198 transition count 496
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 1006 place count 198 transition count 352
Applied a total of 1006 rules in 19 ms. Remains 198 /504 variables (removed 306) and now considering 352/2924 (removed 2572) transitions.
// Phase 1: matrix 352 rows 198 cols
[2025-06-04 23:35:49] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:35:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-04 23:35:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:35:50] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-04 23:35:54] [INFO ] Implicit Places using invariants and state equation in 4527 ms returned []
Implicit Place search using SMT with State Equation took 4682 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2025-06-04 23:35:54] [INFO ] Invariant cache hit.
[2025-06-04 23:35:54] [INFO ] State equation strengthened by 168 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 4 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/550 variables, and 369 constraints, problems are : Problem set: 24 solved, 327 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 17/190 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 8/198 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 327/696 constraints. Problems are: Problem set: 24 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 696 constraints, problems are : Problem set: 24 solved, 327 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 327/351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 24 solved, 327 unsolved
Search for dead transitions found 24 dead transitions in 60282ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/504 places, 328/2924 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 174 transition count 316
Applied a total of 36 rules in 2 ms. Remains 174 /198 variables (removed 24) and now considering 316/328 (removed 12) transitions.
// Phase 1: matrix 316 rows 174 cols
[2025-06-04 23:36:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:36:55] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-04 23:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:36:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-04 23:36:56] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 174/504 places, 316/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66254 ms. Remains : 174/504 places, 316/2924 transitions.
[2025-06-04 23:36:56] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:36:56] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:36:56] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-04 23:36:56] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:36:56] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16398272741538457717.gal : 1 ms
[2025-06-04 23:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability6589468795690802591.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16398272741538457717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6589468795690802591.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:37:26] [INFO ] Flatten gal took : 15 ms
[2025-06-04 23:37:26] [INFO ] Applying decomposition
[2025-06-04 23:37:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2423941864875424445.txt' '-o' '/tmp/graph2423941864875424445.bin' '-w' '/tmp/graph2423941864875424445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2423941864875424445.bin' '-l' '-1' '-v' '-w' '/tmp/graph2423941864875424445.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:37:26] [INFO ] Decomposing Gal with order
[2025-06-04 23:37:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:37:26] [INFO ] Removed a total of 367 redundant transitions.
[2025-06-04 23:37:26] [INFO ] Flatten gal took : 22 ms
[2025-06-04 23:37:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 4 ms.
[2025-06-04 23:37:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14785572377904387589.gal : 2 ms
[2025-06-04 23:37:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3710183889950131155.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14785572377904387589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3710183889950131155.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 2924/2924 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 460 transition count 1080
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 460 transition count 1080
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 460 transition count 1063
Discarding 154 places :
Symmetric choice reduction at 1 with 154 rule applications. Total rules 259 place count 306 transition count 909
Iterating global reduction 1 with 154 rules applied. Total rules applied 413 place count 306 transition count 909
Ensure Unique test removed 267 transitions
Reduce isomorphic transitions removed 267 transitions.
Iterating post reduction 1 with 267 rules applied. Total rules applied 680 place count 306 transition count 642
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 780 place count 206 transition count 542
Iterating global reduction 2 with 100 rules applied. Total rules applied 880 place count 206 transition count 542
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 1040 place count 206 transition count 382
Applied a total of 1040 rules in 21 ms. Remains 206 /504 variables (removed 298) and now considering 382/2924 (removed 2542) transitions.
// Phase 1: matrix 382 rows 206 cols
[2025-06-04 23:37:56] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:37:56] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-04 23:37:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:37:56] [INFO ] State equation strengthened by 191 read => feed constraints.
[2025-06-04 23:37:58] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned []
Implicit Place search using SMT with State Equation took 2516 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2025-06-04 23:37:58] [INFO ] Invariant cache hit.
[2025-06-04 23:37:58] [INFO ] State equation strengthened by 191 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 4 (OVERLAPS) 382/588 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 191/400 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/400 constraints. Problems are: Problem set: 24 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 400 constraints, problems are : Problem set: 24 solved, 357 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 357 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 17/198 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 3 (OVERLAPS) 8/206 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 382/588 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 191/400 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 357/757 constraints. Problems are: Problem set: 24 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/588 variables, and 757 constraints, problems are : Problem set: 24 solved, 357 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 357/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 24 solved, 357 unsolved
Search for dead transitions found 24 dead transitions in 60309ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/504 places, 358/2924 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 182 transition count 346
Applied a total of 36 rules in 1 ms. Remains 182 /206 variables (removed 24) and now considering 346/358 (removed 12) transitions.
// Phase 1: matrix 346 rows 182 cols
[2025-06-04 23:38:59] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:38:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 23:38:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:38:59] [INFO ] State equation strengthened by 187 read => feed constraints.
[2025-06-04 23:39:00] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/504 places, 346/2924 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64156 ms. Remains : 182/504 places, 346/2924 transitions.
[2025-06-04 23:39:00] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:39:00] [INFO ] Flatten gal took : 21 ms
[2025-06-04 23:39:00] [INFO ] Input system was already deterministic with 346 transitions.
[2025-06-04 23:39:00] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:39:00] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9025721436099162657.gal : 1 ms
[2025-06-04 23:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4882254504410579368.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9025721436099162657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4882254504410579368.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:39:30] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:39:30] [INFO ] Applying decomposition
[2025-06-04 23:39:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2421814427903455547.txt' '-o' '/tmp/graph2421814427903455547.bin' '-w' '/tmp/graph2421814427903455547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2421814427903455547.bin' '-l' '-1' '-v' '-w' '/tmp/graph2421814427903455547.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:39:30] [INFO ] Decomposing Gal with order
[2025-06-04 23:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:39:30] [INFO ] Removed a total of 371 redundant transitions.
[2025-06-04 23:39:30] [INFO ] Flatten gal took : 22 ms
[2025-06-04 23:39:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 4 ms.
[2025-06-04 23:39:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4726729572891387082.gal : 2 ms
[2025-06-04 23:39:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16557078602561293360.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4726729572891387082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16557078602561293360.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:40:00] [INFO ] Flatten gal took : 59 ms
[2025-06-04 23:40:00] [INFO ] Flatten gal took : 60 ms
[2025-06-04 23:40:01] [INFO ] Applying decomposition
[2025-06-04 23:40:01] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2120504597297245287.txt' '-o' '/tmp/graph2120504597297245287.bin' '-w' '/tmp/graph2120504597297245287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2120504597297245287.bin' '-l' '-1' '-v' '-w' '/tmp/graph2120504597297245287.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:40:01] [INFO ] Decomposing Gal with order
[2025-06-04 23:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:40:01] [INFO ] Removed a total of 2082 redundant transitions.
[2025-06-04 23:40:01] [INFO ] Flatten gal took : 746 ms
[2025-06-04 23:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2062 labels/synchronizations in 46 ms.
[2025-06-04 23:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14245771281828012548.gal : 9 ms
[2025-06-04 23:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14946712263757746033.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14245771281828012548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14946712263757746033.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2025-06-05 00:00:41] [INFO ] Flatten gal took : 501 ms
[2025-06-05 00:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8092237480393030828.gal : 37 ms
[2025-06-05 00:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability353773120436864280.ctl : 4 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8092237480393030828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability353773120436864280.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="RingSingleMessageInMbox-PT-d1m040"
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-5832"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m040, 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 r184-tall-174889264200434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m040.tgz
mv RingSingleMessageInMbox-PT-d1m040 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.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 ;