About the Execution of ITS-Tools for PolyORBNT-PT-S05J30
| 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 | ???????????T?F?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400642.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 PolyORBNT-PT-S05J30, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400642
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 198K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 364K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 1.2M 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 PolyORBNT-PT-S05J30-CTLFireability-2025-00
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-01
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-02
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-03
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-04
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-05
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-06
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-07
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-08
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-09
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-10
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-11
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-12
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-13
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-14
FORMULA_NAME PolyORBNT-PT-S05J30-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749084180694
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 00:43:01] [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-05 00:43:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:43:02] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2025-06-05 00:43:02] [INFO ] Transformed 489 places.
[2025-06-05 00:43:02] [INFO ] Transformed 1400 transitions.
[2025-06-05 00:43:02] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
[2025-06-05 00:43:02] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-05 00:43:02] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-05 00:43:02] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-05 00:43:02] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-05 00:43:02] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-05 00:43:02] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 265 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 485 transition count 745
Applied a total of 4 rules in 53 ms. Remains 485 /489 variables (removed 4) and now considering 745/745 (removed 0) transitions.
Running 739 sub problems to find dead transitions.
[2025-06-05 00:43:02] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 485 cols
[2025-06-05 00:43:02] [INFO ] Computed 78 invariants in 44 ms
[2025-06-05 00:43:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/485 variables, 7/78 constraints. Problems are: Problem set: 95 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1226 variables, and 78 constraints, problems are : Problem set: 95 solved, 644 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/485 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 644 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 7/485 variables, 7/78 constraints. Problems are: Problem set: 95 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:38] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:43] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 33 ms to minimize.
SMT process timed out in 41025ms, After SMT, problems are : Problem set: 95 solved, 644 unsolved
Search for dead transitions found 95 dead transitions in 41047ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2025-06-05 00:43:43] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 485 cols
[2025-06-05 00:43:43] [INFO ] Computed 78 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:43:43] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-06-05 00:43:43] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:43:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:43:44] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 485/489 places, 650/745 transitions.
Applied a total of 0 rules in 20 ms. Remains 485 /485 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42639 ms. Remains : 485/489 places, 650/745 transitions.
Support contains 265 out of 485 places after structural reductions.
[2025-06-05 00:43:45] [INFO ] Flatten gal took : 114 ms
[2025-06-05 00:43:45] [INFO ] Flatten gal took : 87 ms
[2025-06-05 00:43:45] [INFO ] Input system was already deterministic with 650 transitions.
RANDOM walk for 40000 steps (2748 resets) in 1528 ms. (26 steps per ms) remains 31/71 properties
BEST_FIRST walk for 4003 steps (57 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (71 resets) in 64 ms. (61 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (19 resets) in 104 ms. (38 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (66 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (49 resets) in 89 ms. (44 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (112 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
[2025-06-05 00:43:46] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:43:46] [INFO ] Invariant cache hit.
[2025-06-05 00:43:46] [INFO ] State equation strengthened by 1 read => feed constraints.
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/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 347/437 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 5 (OVERLAPS) 48/485 variables, 17/78 constraints. Problems are: Problem set: 27 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/78 constraints. Problems are: Problem set: 27 solved, 4 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 7 (OVERLAPS) 646/1131 variables, 485/563 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1131 variables, 1/564 constraints. Problems are: Problem set: 28 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:49] [INFO ] Deduced a trap composed of 140 places in 211 ms of which 48 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 1/565 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/565 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/565 constraints. Problems are: Problem set: 28 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 565 constraints, problems are : Problem set: 28 solved, 3 unsolved in 2743 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 485/485 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 220/224 variables, 3/3 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 232/456 variables, 58/61 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/61 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/483 variables, 16/77 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/78 constraints. Problems are: Problem set: 28 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:49] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:50] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:50] [INFO ] Deduced a trap composed of 175 places in 197 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:50] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:50] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:50] [INFO ] Deduced a trap composed of 175 places in 219 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:51] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:51] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:51] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:51] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 62 ms to minimize.
Problem AtomicPropp10 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 10/88 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/88 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/484 variables, 1/89 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/89 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 646/1130 variables, 484/573 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1130 variables, 1/574 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1130 variables, 1/575 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1130 variables, 0/575 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1131 variables, 1/576 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1131 variables, 1/577 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1131 variables, 0/577 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1131 variables, 0/577 constraints. Problems are: Problem set: 29 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 577 constraints, problems are : Problem set: 29 solved, 2 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 485/485 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/27 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6156ms problems are : Problem set: 29 solved, 2 unsolved
Finished Parikh walk after 532 steps, including 37 resets, run visited all 2 properties in 4 ms. (steps per millisecond=133 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 10 ms.
Successfully simplified 29 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S05J30-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 00:43:52] [INFO ] Flatten gal took : 48 ms
[2025-06-05 00:43:53] [INFO ] Flatten gal took : 49 ms
[2025-06-05 00:43:53] [INFO ] Input system was already deterministic with 650 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Applied a total of 1 rules in 21 ms. Remains 484 /485 variables (removed 1) and now considering 650/650 (removed 0) transitions.
Running 644 sub problems to find dead transitions.
[2025-06-05 00:43:53] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2025-06-05 00:43:53] [INFO ] Computed 77 invariants in 10 ms
[2025-06-05 00:43:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:12] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1130 variables, and 78 constraints, problems are : Problem set: 0 solved, 644 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:21] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:23] [INFO ] Deduced a trap composed of 175 places in 925 ms of which 760 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:23] [INFO ] Deduced a trap composed of 175 places in 351 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:24] [INFO ] Deduced a trap composed of 140 places in 204 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:24] [INFO ] Deduced a trap composed of 146 places in 193 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:24] [INFO ] Deduced a trap composed of 208 places in 224 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:24] [INFO ] Deduced a trap composed of 208 places in 222 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:24] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:25] [INFO ] Deduced a trap composed of 208 places in 215 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:25] [INFO ] Deduced a trap composed of 208 places in 213 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:25] [INFO ] Deduced a trap composed of 235 places in 193 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:25] [INFO ] Deduced a trap composed of 235 places in 207 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:26] [INFO ] Deduced a trap composed of 235 places in 208 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:26] [INFO ] Deduced a trap composed of 235 places in 212 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:26] [INFO ] Deduced a trap composed of 235 places in 233 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:32] [INFO ] Deduced a trap composed of 235 places in 244 ms of which 84 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1130 variables, and 94 constraints, problems are : Problem set: 0 solved, 644 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/644 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40376ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 40378ms
[2025-06-05 00:44:33] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:44:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:44:34] [INFO ] Implicit Places using invariants in 447 ms returned []
[2025-06-05 00:44:34] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:44:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:44:36] [INFO ] Implicit Places using invariants and state equation in 2062 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2025-06-05 00:44:36] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:44:36] [INFO ] Invariant cache hit.
[2025-06-05 00:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:55] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:56] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:56] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:56] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:57] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 53 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:02] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:02] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:06] [INFO ] Deduced a trap composed of 76 places in 204 ms of which 46 ms to minimize.
SMT process timed out in 30471ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 30473ms
Starting structural reductions in LTL mode, iteration 1 : 484/485 places, 650/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73388 ms. Remains : 484/485 places, 650/650 transitions.
[2025-06-05 00:45:06] [INFO ] Flatten gal took : 32 ms
[2025-06-05 00:45:06] [INFO ] Flatten gal took : 31 ms
[2025-06-05 00:45:06] [INFO ] Input system was already deterministic with 650 transitions.
[2025-06-05 00:45:06] [INFO ] Flatten gal took : 29 ms
[2025-06-05 00:45:06] [INFO ] Flatten gal took : 28 ms
[2025-06-05 00:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7878378484098823341.gal : 15 ms
[2025-06-05 00:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7999337680414627706.ctl : 5 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/CTLFireability7878378484098823341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7999337680414627706.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-05 00:45:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 00:45:36] [INFO ] Applying decomposition
[2025-06-05 00:45:36] [INFO ] Flatten gal took : 28 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/graph17591366630336304918.txt' '-o' '/tmp/graph17591366630336304918.bin' '-w' '/tmp/graph17591366630336304918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17591366630336304918.bin' '-l' '-1' '-v' '-w' '/tmp/graph17591366630336304918.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:45:37] [INFO ] Decomposing Gal with order
[2025-06-05 00:45:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:45:37] [INFO ] Removed a total of 661 redundant transitions.
[2025-06-05 00:45:37] [INFO ] Flatten gal took : 179 ms
[2025-06-05 00:45:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 29 ms.
[2025-06-05 00:45:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11753472817694356988.gal : 15 ms
[2025-06-05 00:45:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12206954235679393695.ctl : 2 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/CTLFireability11753472817694356988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12206954235679393695.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 110 ms. Remains 411 /485 variables (removed 74) and now considering 577/650 (removed 73) transitions.
Running 571 sub problems to find dead transitions.
[2025-06-05 00:46:07] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2025-06-05 00:46:07] [INFO ] Computed 77 invariants in 6 ms
[2025-06-05 00:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:12] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:12] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:12] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:13] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:13] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:13] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:13] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:13] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:13] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:14] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:14] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:14] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:14] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:14] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:15] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:15] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:15] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:15] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:16] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:16] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:17] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:17] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:17] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:17] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:17] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:18] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:18] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:18] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:18] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:18] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:19] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:19] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:19] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:19] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:26] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:28] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 15 ms to minimize.
SMT process timed out in 20391ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 20392ms
[2025-06-05 00:46:28] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 00:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:28] [INFO ] Implicit Places using invariants in 701 ms returned []
[2025-06-05 00:46:28] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 00:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:46:33] [INFO ] Implicit Places using invariants and state equation in 4250 ms returned []
Implicit Place search using SMT with State Equation took 4958 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:46:33] [INFO ] Redundant transitions in 35 ms returned []
Running 571 sub problems to find dead transitions.
[2025-06-05 00:46:33] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 00:46:33] [INFO ] Invariant cache hit.
[2025-06-05 00:46:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:37] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:37] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:38] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:38] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:38] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:38] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:39] [INFO ] Deduced a trap composed of 105 places in 473 ms of which 339 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:39] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:39] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:40] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:40] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:40] [INFO ] Deduced a trap composed of 105 places in 182 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:40] [INFO ] Deduced a trap composed of 105 places in 183 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:42] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 107 places in 240 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:46] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:46] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:46] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:52] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:52] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:52] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:54] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:54] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:54] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:56] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:57] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:57] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:57] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:57] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:57] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:59] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:59] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:59] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:59] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:59] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:00] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:00] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:00] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:03] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:03] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/984 variables, and 150 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 78/150 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:05] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:05] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:05] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:05] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:06] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:06] [INFO ] Deduced a trap composed of 107 places in 187 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:06] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:06] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:06] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:06] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:07] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:07] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:07] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:07] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:07] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:08] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:08] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:08] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:08] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:08] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:15] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:15] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:15] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:15] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:15] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:16] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:16] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:16] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:16] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:29] [INFO ] Deduced a trap composed of 190 places in 12150 ms of which 12003 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:33] [INFO ] Deduced a trap composed of 74 places in 4383 ms of which 4233 ms to minimize.
SMT process timed out in 60505ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Starting structural reductions in SI_CTL mode, iteration 1 : 411/485 places, 577/650 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86015 ms. Remains : 411/485 places, 577/650 transitions.
[2025-06-05 00:47:33] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:47:33] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:47:33] [INFO ] Input system was already deterministic with 577 transitions.
[2025-06-05 00:47:33] [INFO ] Flatten gal took : 23 ms
[2025-06-05 00:47:33] [INFO ] Flatten gal took : 23 ms
[2025-06-05 00:47:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11269239830005208710.gal : 4 ms
[2025-06-05 00:47:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9328039814654821423.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/CTLFireability11269239830005208710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9328039814654821423.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-05 00:48:03] [INFO ] Flatten gal took : 24 ms
[2025-06-05 00:48:03] [INFO ] Applying decomposition
[2025-06-05 00:48:03] [INFO ] Flatten gal took : 22 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/graph8492014318797699279.txt' '-o' '/tmp/graph8492014318797699279.bin' '-w' '/tmp/graph8492014318797699279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8492014318797699279.bin' '-l' '-1' '-v' '-w' '/tmp/graph8492014318797699279.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:48:03] [INFO ] Decomposing Gal with order
[2025-06-05 00:48:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:48:04] [INFO ] Removed a total of 544 redundant transitions.
[2025-06-05 00:48:04] [INFO ] Flatten gal took : 76 ms
[2025-06-05 00:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 13 ms.
[2025-06-05 00:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16862013819718556077.gal : 8 ms
[2025-06-05 00:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9412141766143120618.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/CTLFireability16862013819718556077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9412141766143120618.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 38 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 00:48:34] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 00:48:34] [INFO ] Computed 77 invariants in 7 ms
[2025-06-05 00:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:53] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:54] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:54] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:54] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 59 ms to minimize.
SMT process timed out in 20565ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20568ms
[2025-06-05 00:48:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:48:55] [INFO ] Implicit Places using invariants in 979 ms returned []
[2025-06-05 00:48:55] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:49:00] [INFO ] Implicit Places using invariants and state equation in 4833 ms returned []
Implicit Place search using SMT with State Equation took 5814 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 00:49:00] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:49:00] [INFO ] Invariant cache hit.
[2025-06-05 00:49:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:20] [INFO ] Deduced a trap composed of 175 places in 236 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:21] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:21] [INFO ] Deduced a trap composed of 175 places in 241 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:21] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:21] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:22] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:29] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:30] [INFO ] Deduced a trap composed of 205 places in 183 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:30] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:30] [INFO ] Deduced a trap composed of 205 places in 174 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:30] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:31] [INFO ] Deduced a trap composed of 205 places in 189 ms of which 39 ms to minimize.
SMT process timed out in 30386ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30390ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56815 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 00:49:31] [INFO ] Flatten gal took : 21 ms
[2025-06-05 00:49:31] [INFO ] Flatten gal took : 23 ms
[2025-06-05 00:49:31] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 00:49:31] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:49:31] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:49:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16443339460600277247.gal : 3 ms
[2025-06-05 00:49:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18262208846840682600.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/CTLFireability16443339460600277247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18262208846840682600.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.
Detected timeout of ITS tools.
[2025-06-05 00:50:01] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:50:01] [INFO ] Applying decomposition
[2025-06-05 00:50:01] [INFO ] Flatten gal took : 19 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/graph13617274828738213524.txt' '-o' '/tmp/graph13617274828738213524.bin' '-w' '/tmp/graph13617274828738213524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13617274828738213524.bin' '-l' '-1' '-v' '-w' '/tmp/graph13617274828738213524.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:50:01] [INFO ] Decomposing Gal with order
[2025-06-05 00:50:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:50:01] [INFO ] Removed a total of 661 redundant transitions.
[2025-06-05 00:50:01] [INFO ] Flatten gal took : 48 ms
[2025-06-05 00:50:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 8 ms.
[2025-06-05 00:50:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1871901409554101438.gal : 6 ms
[2025-06-05 00:50:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10155688049373541833.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/CTLFireability1871901409554101438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10155688049373541833.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Applied a total of 1 rules in 19 ms. Remains 484 /485 variables (removed 1) and now considering 650/650 (removed 0) transitions.
Running 644 sub problems to find dead transitions.
[2025-06-05 00:50:31] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2025-06-05 00:50:31] [INFO ] Computed 77 invariants in 14 ms
[2025-06-05 00:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:51] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 15 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1130 variables, and 78 constraints, problems are : Problem set: 0 solved, 644 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:00] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:01] [INFO ] Deduced a trap composed of 175 places in 925 ms of which 766 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:02] [INFO ] Deduced a trap composed of 175 places in 350 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:02] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:02] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:02] [INFO ] Deduced a trap composed of 208 places in 223 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:02] [INFO ] Deduced a trap composed of 208 places in 227 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 208 places in 222 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 208 places in 211 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 235 places in 225 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 235 places in 201 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 235 places in 217 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 235 places in 221 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 235 places in 238 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:10] [INFO ] Deduced a trap composed of 235 places in 239 ms of which 85 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1130 variables, and 94 constraints, problems are : Problem set: 0 solved, 644 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/644 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40395ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 40397ms
[2025-06-05 00:51:11] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:51:12] [INFO ] Implicit Places using invariants in 850 ms returned []
[2025-06-05 00:51:12] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:51:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:51:16] [INFO ] Implicit Places using invariants and state equation in 4140 ms returned []
Implicit Place search using SMT with State Equation took 4992 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2025-06-05 00:51:16] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2025-06-05 00:51:16] [INFO ] Invariant cache hit.
[2025-06-05 00:51:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:36] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:37] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:37] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:38] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:38] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 53 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 175 places in 233 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 85 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1130 variables, and 84 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 6/484 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:59] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:59] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:59] [INFO ] Deduced a trap composed of 175 places in 179 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:59] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:00] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:00] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:01] [INFO ] Deduced a trap composed of 235 places in 211 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:01] [INFO ] Deduced a trap composed of 235 places in 202 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:02] [INFO ] Deduced a trap composed of 235 places in 209 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:02] [INFO ] Deduced a trap composed of 235 places in 203 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:05] [INFO ] Deduced a trap composed of 205 places in 211 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:05] [INFO ] Deduced a trap composed of 205 places in 186 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:05] [INFO ] Deduced a trap composed of 205 places in 205 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 205 places in 231 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 205 places in 236 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 208 places in 257 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 208 places in 206 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:09] [INFO ] Deduced a trap composed of 175 places in 196 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:10] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 43 ms to minimize.
Problem TDEAD250 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1130 variables, and 103 constraints, problems are : Problem set: 1 solved, 643 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/644 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 1 solved, 643 unsolved
Search for dead transitions found 1 dead transitions in 60403ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/485 places, 649/650 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 483 transition count 649
Applied a total of 1 rules in 11 ms. Remains 483 /484 variables (removed 1) and now considering 649/649 (removed 0) transitions.
[2025-06-05 00:52:17] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 00:52:17] [INFO ] Computed 76 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:52:18] [INFO ] Implicit Places using invariants in 744 ms returned []
[2025-06-05 00:52:18] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:52:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:52:22] [INFO ] Implicit Places using invariants and state equation in 4004 ms returned []
Implicit Place search using SMT with State Equation took 4751 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110577 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 00:52:22] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:52:22] [INFO ] Flatten gal took : 21 ms
[2025-06-05 00:52:22] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 00:52:22] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:52:22] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1595702763586612421.gal : 5 ms
[2025-06-05 00:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9156675161100602979.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/CTLFireability1595702763586612421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9156675161100602979.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-05 00:52:52] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:52:52] [INFO ] Applying decomposition
[2025-06-05 00:52:52] [INFO ] Flatten gal took : 21 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/graph1676895099007936939.txt' '-o' '/tmp/graph1676895099007936939.bin' '-w' '/tmp/graph1676895099007936939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1676895099007936939.bin' '-l' '-1' '-v' '-w' '/tmp/graph1676895099007936939.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:52:52] [INFO ] Decomposing Gal with order
[2025-06-05 00:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:52:52] [INFO ] Removed a total of 759 redundant transitions.
[2025-06-05 00:52:52] [INFO ] Flatten gal took : 45 ms
[2025-06-05 00:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 7 ms.
[2025-06-05 00:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10350974824530176671.gal : 6 ms
[2025-06-05 00:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11320395690516226172.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/CTLFireability10350974824530176671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11320395690516226172.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 649
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 483 transition count 647
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 481 transition count 647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 481 transition count 646
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 480 transition count 646
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 479 transition count 645
Applied a total of 10 rules in 56 ms. Remains 479 /485 variables (removed 6) and now considering 645/650 (removed 5) transitions.
Running 639 sub problems to find dead transitions.
[2025-06-05 00:53:22] [INFO ] Flow matrix only has 641 transitions (discarded 4 similar events)
// Phase 1: matrix 641 rows 479 cols
[2025-06-05 00:53:22] [INFO ] Computed 77 invariants in 9 ms
[2025-06-05 00:53:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (OVERLAPS) 6/479 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:41] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:46] [INFO ] Deduced a trap composed of 137 places in 4520 ms of which 4354 ms to minimize.
SMT process timed out in 23933ms, After SMT, problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 23935ms
[2025-06-05 00:53:46] [INFO ] Flow matrix only has 641 transitions (discarded 4 similar events)
[2025-06-05 00:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:53:47] [INFO ] Implicit Places using invariants in 481 ms returned []
[2025-06-05 00:53:47] [INFO ] Flow matrix only has 641 transitions (discarded 4 similar events)
[2025-06-05 00:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:53:49] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:53:49] [INFO ] Redundant transitions in 22 ms returned []
Running 639 sub problems to find dead transitions.
[2025-06-05 00:53:49] [INFO ] Flow matrix only has 641 transitions (discarded 4 similar events)
[2025-06-05 00:53:49] [INFO ] Invariant cache hit.
[2025-06-05 00:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (OVERLAPS) 6/479 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:08] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:08] [INFO ] Deduced a trap composed of 137 places in 225 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:08] [INFO ] Deduced a trap composed of 232 places in 194 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:08] [INFO ] Deduced a trap composed of 232 places in 188 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:09] [INFO ] Deduced a trap composed of 232 places in 191 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:09] [INFO ] Deduced a trap composed of 232 places in 206 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:09] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 45 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:14] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:14] [INFO ] Deduced a trap composed of 172 places in 209 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:14] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:14] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:16] [INFO ] Deduced a trap composed of 107 places in 195 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:16] [INFO ] Deduced a trap composed of 202 places in 200 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 202 places in 192 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 107 places in 197 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 202 places in 214 ms of which 66 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1120 variables, and 94 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/479 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (OVERLAPS) 6/479 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:49] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1120 variables, and 95 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/479 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/639 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Starting structural reductions in SI_CTL mode, iteration 1 : 479/485 places, 645/650 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86798 ms. Remains : 479/485 places, 645/650 transitions.
[2025-06-05 00:54:49] [INFO ] Flatten gal took : 21 ms
[2025-06-05 00:54:49] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:54:49] [INFO ] Input system was already deterministic with 645 transitions.
[2025-06-05 00:54:49] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:54:49] [INFO ] Flatten gal took : 32 ms
[2025-06-05 00:54:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15080169992766197787.gal : 3 ms
[2025-06-05 00:54:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1385305143172955252.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/CTLFireability15080169992766197787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1385305143172955252.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-05 00:55:19] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:55:19] [INFO ] Applying decomposition
[2025-06-05 00:55:19] [INFO ] Flatten gal took : 23 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/graph10908191203491578640.txt' '-o' '/tmp/graph10908191203491578640.bin' '-w' '/tmp/graph10908191203491578640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10908191203491578640.bin' '-l' '-1' '-v' '-w' '/tmp/graph10908191203491578640.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:55:19] [INFO ] Decomposing Gal with order
[2025-06-05 00:55:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:55:19] [INFO ] Removed a total of 665 redundant transitions.
[2025-06-05 00:55:19] [INFO ] Flatten gal took : 58 ms
[2025-06-05 00:55:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 21 ms.
[2025-06-05 00:55:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2094406499771229026.gal : 6 ms
[2025-06-05 00:55:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4837167113954103907.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/CTLFireability2094406499771229026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4837167113954103907.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 19 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 00:55:50] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 00:55:50] [INFO ] Computed 77 invariants in 13 ms
[2025-06-05 00:55:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:09] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:09] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:10] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:10] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 60 ms to minimize.
SMT process timed out in 20369ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20370ms
[2025-06-05 00:56:10] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:56:10] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-06-05 00:56:10] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:56:13] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 3178 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 00:56:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:56:13] [INFO ] Invariant cache hit.
[2025-06-05 00:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:33] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:33] [INFO ] Deduced a trap composed of 175 places in 236 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:34] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:34] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:34] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:34] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:42] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:42] [INFO ] Deduced a trap composed of 205 places in 190 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:42] [INFO ] Deduced a trap composed of 107 places in 197 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:43] [INFO ] Deduced a trap composed of 205 places in 180 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:43] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:43] [INFO ] Deduced a trap composed of 205 places in 180 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:43] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:43] [INFO ] Deduced a trap composed of 205 places in 181 ms of which 39 ms to minimize.
SMT process timed out in 30393ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30395ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53967 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 00:56:43] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:56:44] [INFO ] Flatten gal took : 21 ms
[2025-06-05 00:56:44] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 00:56:44] [INFO ] Flatten gal took : 21 ms
[2025-06-05 00:56:44] [INFO ] Flatten gal took : 21 ms
[2025-06-05 00:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11061781786458469831.gal : 4 ms
[2025-06-05 00:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability720878524835824684.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/CTLFireability11061781786458469831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability720878524835824684.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-05 00:57:14] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:57:14] [INFO ] Applying decomposition
[2025-06-05 00:57:14] [INFO ] Flatten gal took : 21 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/graph1306788797385526135.txt' '-o' '/tmp/graph1306788797385526135.bin' '-w' '/tmp/graph1306788797385526135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1306788797385526135.bin' '-l' '-1' '-v' '-w' '/tmp/graph1306788797385526135.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:57:14] [INFO ] Decomposing Gal with order
[2025-06-05 00:57:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:57:14] [INFO ] Removed a total of 665 redundant transitions.
[2025-06-05 00:57:14] [INFO ] Flatten gal took : 63 ms
[2025-06-05 00:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 10 ms.
[2025-06-05 00:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability597764576651548404.gal : 7 ms
[2025-06-05 00:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4632343875875070844.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/CTLFireability597764576651548404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4632343875875070844.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 17 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 00:57:44] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:57:44] [INFO ] Invariant cache hit.
[2025-06-05 00:57:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:04] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:04] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:04] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 82 ms to minimize.
SMT process timed out in 20429ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20430ms
[2025-06-05 00:58:04] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:58:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:58:05] [INFO ] Implicit Places using invariants in 894 ms returned []
[2025-06-05 00:58:05] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:58:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:58:09] [INFO ] Implicit Places using invariants and state equation in 3877 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 00:58:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 00:58:09] [INFO ] Invariant cache hit.
[2025-06-05 00:58:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:29] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:29] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:30] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:30] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:30] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:30] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:38] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:39] [INFO ] Deduced a trap composed of 205 places in 182 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:39] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:39] [INFO ] Deduced a trap composed of 205 places in 182 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:39] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:39] [INFO ] Deduced a trap composed of 205 places in 185 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:58:40] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 54 ms to minimize.
SMT process timed out in 30495ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30496ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55719 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 00:58:40] [INFO ] Flatten gal took : 19 ms
[2025-06-05 00:58:40] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:58:40] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 00:58:40] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:58:40] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12777840850277577165.gal : 4 ms
[2025-06-05 00:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13655045116893644511.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/CTLFireability12777840850277577165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13655045116893644511.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.
Detected timeout of ITS tools.
[2025-06-05 00:59:10] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:59:10] [INFO ] Applying decomposition
[2025-06-05 00:59:10] [INFO ] Flatten gal took : 20 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/graph15311845406707351651.txt' '-o' '/tmp/graph15311845406707351651.bin' '-w' '/tmp/graph15311845406707351651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15311845406707351651.bin' '-l' '-1' '-v' '-w' '/tmp/graph15311845406707351651.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:59:10] [INFO ] Decomposing Gal with order
[2025-06-05 00:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:59:10] [INFO ] Removed a total of 661 redundant transitions.
[2025-06-05 00:59:10] [INFO ] Flatten gal took : 59 ms
[2025-06-05 00:59:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 9 ms.
[2025-06-05 00:59:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5024733045367473023.gal : 6 ms
[2025-06-05 00:59:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12196146090854419224.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/CTLFireability5024733045367473023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12196146090854419224.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 56 ms. Remains 412 /485 variables (removed 73) and now considering 578/650 (removed 72) transitions.
Running 572 sub problems to find dead transitions.
[2025-06-05 00:59:40] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2025-06-05 00:59:40] [INFO ] Computed 77 invariants in 9 ms
[2025-06-05 00:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:45] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:45] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:45] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:46] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:46] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:46] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:46] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:46] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:47] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:47] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:47] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:47] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:47] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:47] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:48] [INFO ] Deduced a trap composed of 106 places in 184 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:48] [INFO ] Deduced a trap composed of 108 places in 264 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:48] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:48] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:48] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:49] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:50] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:50] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:50] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:50] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:51] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:51] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:51] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:51] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:51] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:52] [INFO ] Deduced a trap composed of 108 places in 280 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:52] [INFO ] Deduced a trap composed of 108 places in 226 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:52] [INFO ] Deduced a trap composed of 108 places in 197 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:52] [INFO ] Deduced a trap composed of 108 places in 184 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:53] [INFO ] Deduced a trap composed of 108 places in 188 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:53] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:53] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:53] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:58] [INFO ] Deduced a trap composed of 108 places in 4943 ms of which 4815 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:58] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:59:59] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 31 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 (/ 3.0 2.0))
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 1.0 4.0))
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 (/ 3.0 4.0))
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 (/ 1.0 4.0))
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 9.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 (/ 1.0 12.0))
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 (/ 1.0 4.0))
(s90 (/ 1.0 2.0))
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 (/ 1.0 2.0))
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 (/ 1.0 4.0))
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 (/ 1.0 4.0))
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 (/ 7.0 12.0))
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 (/ 17.0 2.0))
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 (/ 3.0 4.0))
(s217 0.0)
(s218 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 (/ 1.0 4.0))
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 (/ 1.0 4.0))
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 (/ 1.0 4.0))
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 (/ 1.0 2.0))
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 (/ 1.0 3.0))
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 (/ 3.0 4.0))
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 (/ 3.0 4.0))
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/986 variables, and 112 constraints, problems are : Problem set: 0 solved, 572 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/18 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:03] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:04] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:04] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:04] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:04] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:04] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:05] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:05] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:05] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:05] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:05] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:05] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:06] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:06] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:06] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:06] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:06] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:06] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:07] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:07] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:10] [INFO ] Deduced a trap composed of 110 places in 189 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:10] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:11] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:11] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:11] [INFO ] Deduced a trap composed of 112 places in 173 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:11] [INFO ] Deduced a trap composed of 106 places in 335 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:12] [INFO ] Deduced a trap composed of 108 places in 430 ms of which 289 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:12] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:12] [INFO ] Deduced a trap composed of 108 places in 399 ms of which 260 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:13] [INFO ] Deduced a trap composed of 108 places in 191 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:13] [INFO ] Deduced a trap composed of 108 places in 247 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:13] [INFO ] Deduced a trap composed of 108 places in 348 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:13] [INFO ] Deduced a trap composed of 108 places in 241 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:14] [INFO ] Deduced a trap composed of 108 places in 214 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:14] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:14] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:14] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:15] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:15] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:15] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 44 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/986 variables, and 152 constraints, problems are : Problem set: 0 solved, 572 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/18 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/572 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40376ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 40377ms
[2025-06-05 01:00:21] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2025-06-05 01:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:00:21] [INFO ] Implicit Places using invariants in 693 ms returned []
[2025-06-05 01:00:21] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2025-06-05 01:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:00:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:00:25] [INFO ] Implicit Places using invariants and state equation in 4121 ms returned []
Implicit Place search using SMT with State Equation took 4816 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:00:25] [INFO ] Redundant transitions in 10 ms returned []
Running 572 sub problems to find dead transitions.
[2025-06-05 01:00:25] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2025-06-05 01:00:25] [INFO ] Invariant cache hit.
[2025-06-05 01:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:30] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:30] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:31] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:31] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:31] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:31] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:31] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:31] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:32] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:32] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:32] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:32] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:32] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:32] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:33] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:33] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:33] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:33] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:33] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:34] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:34] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:35] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:35] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:35] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:36] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:36] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:36] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:36] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:36] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:37] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:37] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:37] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:37] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:37] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:38] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:38] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:38] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:38] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:38] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:38] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:45] [INFO ] Deduced a trap composed of 106 places in 270 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:45] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:45] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:45] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:45] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:45] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:46] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:46] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:46] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:46] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:46] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:47] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:47] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:47] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:50] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:50] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:50] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:50] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:50] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:51] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:51] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:51] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:51] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:52] [INFO ] Deduced a trap composed of 108 places in 220 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:52] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:52] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:52] [INFO ] Deduced a trap composed of 109 places in 172 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:52] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:53] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:53] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:53] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:53] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:53] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:00:53] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/986 variables, and 146 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/18 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 74/146 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:01] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:01] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:02] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:02] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:02] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:03] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:03] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:03] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:03] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:04] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:04] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:04] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:04] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:04] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:05] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:05] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:05] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:05] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:05] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:01:06] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/986 variables, and 166 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/18 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/572 constraints, Known Traps: 94/94 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in SI_CTL mode, iteration 1 : 412/485 places, 578/650 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105615 ms. Remains : 412/485 places, 578/650 transitions.
[2025-06-05 01:01:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:01:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:01:26] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-05 01:01:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:01:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:01:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11497824651059115419.gal : 3 ms
[2025-06-05 01:01:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4603501782255005833.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/CTLFireability11497824651059115419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4603501782255005833.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-05 01:01:56] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:01:56] [INFO ] Applying decomposition
[2025-06-05 01:01:56] [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/graph5820584939226403894.txt' '-o' '/tmp/graph5820584939226403894.bin' '-w' '/tmp/graph5820584939226403894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5820584939226403894.bin' '-l' '-1' '-v' '-w' '/tmp/graph5820584939226403894.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:01:56] [INFO ] Decomposing Gal with order
[2025-06-05 01:01:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:01:56] [INFO ] Removed a total of 631 redundant transitions.
[2025-06-05 01:01:56] [INFO ] Flatten gal took : 41 ms
[2025-06-05 01:01:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2025-06-05 01:01:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6516835919329633372.gal : 4 ms
[2025-06-05 01:01:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8368796422758544934.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/CTLFireability6516835919329633372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8368796422758544934.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 : 485/485 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 484 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 484 transition count 649
Applied a total of 2 rules in 17 ms. Remains 484 /485 variables (removed 1) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:02:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 484 cols
[2025-06-05 01:02:26] [INFO ] Computed 78 invariants in 7 ms
[2025-06-05 01:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 7/484 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:46] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 22 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 9.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 8.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)timeout
(s220 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1129 variables, and 79 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 7/484 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:56] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:56] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:56] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:56] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:57] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:57] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:58] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:02:58] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:06] [INFO ] Deduced a trap composed of 205 places in 5848 ms of which 5683 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:12] [INFO ] Deduced a trap composed of 205 places in 6283 ms of which 6134 ms to minimize.
SMT process timed out in 45659ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 45660ms
[2025-06-05 01:03:12] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:03:13] [INFO ] Implicit Places using invariants in 935 ms returned []
[2025-06-05 01:03:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:03:18] [INFO ] Implicit Places using invariants and state equation in 5084 ms returned []
Implicit Place search using SMT with State Equation took 6020 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:03:18] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:03:18] [INFO ] Invariant cache hit.
[2025-06-05 01:03:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 7/484 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:38] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:38] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:38] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:39] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:39] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:39] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:39] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 81 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:47] [INFO ] Deduced a trap composed of 107 places in 197 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:47] [INFO ] Deduced a trap composed of 205 places in 196 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:47] [INFO ] Deduced a trap composed of 205 places in 203 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:48] [INFO ] Deduced a trap composed of 107 places in 213 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:48] [INFO ] Deduced a trap composed of 205 places in 218 ms of which 71 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1129 variables, and 90 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 7/484 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:56] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:03:56] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:00] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:00] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:01] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:01] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:01] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 49 ms to minimize.
Problem TDEAD250 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:01] [INFO ] Deduced a trap composed of 143 places in 215 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:02] [INFO ] Deduced a trap composed of 143 places in 207 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:02] [INFO ] Deduced a trap composed of 146 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:02] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:02] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:03] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:03] [INFO ] Deduced a trap composed of 146 places in 183 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:03] [INFO ] Deduced a trap composed of 146 places in 187 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:03] [INFO ] Deduced a trap composed of 146 places in 184 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:03] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:04] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:04] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:04] [INFO ] Deduced a trap composed of 146 places in 182 ms of which 31 ms to minimize.
Problem TDEAD250 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/110 constraints. Problems are: Problem set: 1 solved, 642 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:13] [INFO ] Deduced a trap composed of 208 places in 222 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:13] [INFO ] Deduced a trap composed of 208 places in 189 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:14] [INFO ] Deduced a trap composed of 208 places in 231 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:14] [INFO ] Deduced a trap composed of 208 places in 205 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:04:14] [INFO ] Deduced a trap composed of 208 places in 242 ms of which 86 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1129 variables, and 115 constraints, problems are : Problem set: 1 solved, 642 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 1 solved, 642 unsolved
Search for dead transitions found 1 dead transitions in 60332ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/485 places, 648/650 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 483 transition count 648
Applied a total of 1 rules in 9 ms. Remains 483 /484 variables (removed 1) and now considering 648/648 (removed 0) transitions.
[2025-06-05 01:04:18] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
// Phase 1: matrix 644 rows 483 cols
[2025-06-05 01:04:18] [INFO ] Computed 77 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:04:19] [INFO ] Implicit Places using invariants in 910 ms returned []
[2025-06-05 01:04:19] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-05 01:04:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:04:24] [INFO ] Implicit Places using invariants and state equation in 4773 ms returned []
Implicit Place search using SMT with State Equation took 5684 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 483/485 places, 648/650 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117728 ms. Remains : 483/485 places, 648/650 transitions.
[2025-06-05 01:04:24] [INFO ] Flatten gal took : 21 ms
[2025-06-05 01:04:24] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:04:24] [INFO ] Input system was already deterministic with 648 transitions.
[2025-06-05 01:04:24] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:04:24] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:04:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1456146528485340951.gal : 3 ms
[2025-06-05 01:04:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7375466833676867971.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/CTLFireability1456146528485340951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7375466833676867971.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-05 01:04:54] [INFO ] Flatten gal took : 23 ms
[2025-06-05 01:04:54] [INFO ] Applying decomposition
[2025-06-05 01:04:54] [INFO ] Flatten gal took : 19 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/graph8883178500684901938.txt' '-o' '/tmp/graph8883178500684901938.bin' '-w' '/tmp/graph8883178500684901938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8883178500684901938.bin' '-l' '-1' '-v' '-w' '/tmp/graph8883178500684901938.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:04:54] [INFO ] Decomposing Gal with order
[2025-06-05 01:04:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:04:54] [INFO ] Removed a total of 689 redundant transitions.
[2025-06-05 01:04:54] [INFO ] Flatten gal took : 41 ms
[2025-06-05 01:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 5 ms.
[2025-06-05 01:04:54] [INFO ] Time to serialize gal into /tmp/CTLFireability927459826684485255.gal : 5 ms
[2025-06-05 01:04:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12965216644600844083.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/CTLFireability927459826684485255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12965216644600844083.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 16 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:05:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 01:05:24] [INFO ] Computed 77 invariants in 26 ms
[2025-06-05 01:05:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:05:44] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:05:44] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:05:45] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:05:45] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:05:45] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 73 ms to minimize.
SMT process timed out in 20522ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20523ms
[2025-06-05 01:05:45] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:05:46] [INFO ] Implicit Places using invariants in 935 ms returned []
[2025-06-05 01:05:46] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:05:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:05:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:05:51] [INFO ] Implicit Places using invariants and state equation in 4854 ms returned []
Implicit Place search using SMT with State Equation took 5790 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:05:51] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:05:51] [INFO ] Invariant cache hit.
[2025-06-05 01:05:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:10] [INFO ] Deduced a trap composed of 175 places in 254 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:10] [INFO ] Deduced a trap composed of 175 places in 257 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:11] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:11] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:11] [INFO ] Deduced a trap composed of 175 places in 243 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:11] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:19] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:19] [INFO ] Deduced a trap composed of 205 places in 195 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:19] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:19] [INFO ] Deduced a trap composed of 205 places in 194 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:20] [INFO ] Deduced a trap composed of 107 places in 194 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:20] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:20] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:06:20] [INFO ] Deduced a trap composed of 205 places in 203 ms of which 40 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 3.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 9.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 (/ 1.0 3.0))
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 91 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1128 variables, and 91 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86725 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 01:06:51] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:06:51] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:06:51] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 01:06:51] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:06:51] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:06:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1380610032922000306.gal : 3 ms
[2025-06-05 01:06:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1277317548181955325.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/CTLFireability1380610032922000306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1277317548181955325.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-05 01:07:21] [INFO ] Flatten gal took : 26 ms
[2025-06-05 01:07:21] [INFO ] Applying decomposition
[2025-06-05 01:07:21] [INFO ] Flatten gal took : 19 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/graph1925646466589716291.txt' '-o' '/tmp/graph1925646466589716291.bin' '-w' '/tmp/graph1925646466589716291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1925646466589716291.bin' '-l' '-1' '-v' '-w' '/tmp/graph1925646466589716291.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:07:21] [INFO ] Decomposing Gal with order
[2025-06-05 01:07:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:07:22] [INFO ] Removed a total of 661 redundant transitions.
[2025-06-05 01:07:22] [INFO ] Flatten gal took : 50 ms
[2025-06-05 01:07:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 13 ms.
[2025-06-05 01:07:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4949157492407044986.gal : 5 ms
[2025-06-05 01:07:22] [INFO ] Time to serialize properties into /tmp/CTLFireability873879440983539649.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/CTLFireability4949157492407044986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability873879440983539649.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 48 ms. Remains 411 /485 variables (removed 74) and now considering 577/650 (removed 73) transitions.
Running 571 sub problems to find dead transitions.
[2025-06-05 01:07:52] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2025-06-05 01:07:52] [INFO ] Computed 77 invariants in 6 ms
[2025-06-05 01:07:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:56] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:57] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:57] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:57] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:57] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:58] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:58] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:58] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:58] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:58] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:58] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:59] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:59] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:59] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:59] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:59] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:07:59] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:00] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:00] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:00] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:01] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:01] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:01] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:02] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:02] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:02] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:02] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:02] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:02] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:03] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:03] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:03] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:03] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:03] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:03] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:04] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:04] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:04] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:04] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:04] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:10] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:11] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:11] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:11] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:11] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:12] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:12] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:12] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:12] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 34 ms to minimize.
SMT process timed out in 20337ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 20338ms
[2025-06-05 01:08:12] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 01:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:08:13] [INFO ] Implicit Places using invariants in 621 ms returned []
[2025-06-05 01:08:13] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 01:08:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:08:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:08:16] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 4014 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:08:16] [INFO ] Redundant transitions in 9 ms returned []
Running 571 sub problems to find dead transitions.
[2025-06-05 01:08:16] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 01:08:16] [INFO ] Invariant cache hit.
[2025-06-05 01:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:20] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:21] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:22] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:22] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:22] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:22] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:22] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:22] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:23] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:23] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:23] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:23] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:24] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:24] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:25] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:25] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:25] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:26] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:26] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:26] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:26] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:26] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:26] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:27] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:27] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:27] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:27] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:27] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:28] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:28] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:28] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:28] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:28] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:08:29] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 5/411 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 571 unsolved
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Starting structural reductions in SI_CTL mode, iteration 1 : 411/485 places, 577/650 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54713 ms. Remains : 411/485 places, 577/650 transitions.
[2025-06-05 01:08:46] [INFO ] Flatten gal took : 18 ms
[2025-06-05 01:08:46] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:08:46] [INFO ] Input system was already deterministic with 577 transitions.
[2025-06-05 01:08:46] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:08:46] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:08:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17374409507973128162.gal : 3 ms
[2025-06-05 01:08:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17292530195071765990.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/CTLFireability17374409507973128162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17292530195071765990.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.
Detected timeout of ITS tools.
[2025-06-05 01:09:17] [INFO ] Flatten gal took : 17 ms
[2025-06-05 01:09:17] [INFO ] Applying decomposition
[2025-06-05 01:09:17] [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/graph415267665253836481.txt' '-o' '/tmp/graph415267665253836481.bin' '-w' '/tmp/graph415267665253836481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph415267665253836481.bin' '-l' '-1' '-v' '-w' '/tmp/graph415267665253836481.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:09:17] [INFO ] Decomposing Gal with order
[2025-06-05 01:09:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:09:17] [INFO ] Removed a total of 701 redundant transitions.
[2025-06-05 01:09:17] [INFO ] Flatten gal took : 38 ms
[2025-06-05 01:09:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 4 ms.
[2025-06-05 01:09:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13297037010897615067.gal : 4 ms
[2025-06-05 01:09:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3736099391433465794.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/CTLFireability13297037010897615067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3736099391433465794.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 16 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:09:47] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 01:09:47] [INFO ] Computed 77 invariants in 7 ms
[2025-06-05 01:09:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:06] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:06] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:07] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:07] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:07] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:07] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 58 ms to minimize.
SMT process timed out in 20453ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20454ms
[2025-06-05 01:10:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:10:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:10:08] [INFO ] Implicit Places using invariants in 933 ms returned []
[2025-06-05 01:10:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:10:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:10:13] [INFO ] Implicit Places using invariants and state equation in 4863 ms returned []
Implicit Place search using SMT with State Equation took 5797 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:10:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:10:13] [INFO ] Invariant cache hit.
[2025-06-05 01:10:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:33] [INFO ] Deduced a trap composed of 175 places in 251 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:33] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:33] [INFO ] Deduced a trap composed of 175 places in 228 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:34] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:34] [INFO ] Deduced a trap composed of 175 places in 213 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:34] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 205 places in 184 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 107 places in 199 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 205 places in 178 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 107 places in 205 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:43] [INFO ] Deduced a trap composed of 205 places in 188 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:43] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:43] [INFO ] Deduced a trap composed of 205 places in 191 ms of which 40 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 91 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1128 variables, and 91 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86643 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 01:11:13] [INFO ] Flatten gal took : 18 ms
[2025-06-05 01:11:13] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:11:13] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 01:11:13] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:11:13] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:11:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11711466777205655965.gal : 3 ms
[2025-06-05 01:11:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6747970827048591628.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/CTLFireability11711466777205655965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6747970827048591628.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-05 01:11:44] [INFO ] Flatten gal took : 25 ms
[2025-06-05 01:11:44] [INFO ] Applying decomposition
[2025-06-05 01:11:44] [INFO ] Flatten gal took : 19 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/graph897953968793073755.txt' '-o' '/tmp/graph897953968793073755.bin' '-w' '/tmp/graph897953968793073755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph897953968793073755.bin' '-l' '-1' '-v' '-w' '/tmp/graph897953968793073755.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:11:44] [INFO ] Decomposing Gal with order
[2025-06-05 01:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:11:44] [INFO ] Removed a total of 755 redundant transitions.
[2025-06-05 01:11:44] [INFO ] Flatten gal took : 35 ms
[2025-06-05 01:11:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 7 ms.
[2025-06-05 01:11:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8122578205154993927.gal : 4 ms
[2025-06-05 01:11:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5631086494901195911.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/CTLFireability8122578205154993927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5631086494901195911.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 24 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:12:14] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:14] [INFO ] Invariant cache hit.
[2025-06-05 01:12:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:34] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:34] [INFO ] Deduced a trap composed of 175 places in 233 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:34] [INFO ] Deduced a trap composed of 175 places in 237 ms of which 82 ms to minimize.
SMT process timed out in 20328ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20329ms
[2025-06-05 01:12:34] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:12:35] [INFO ] Implicit Places using invariants in 923 ms returned []
[2025-06-05 01:12:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:12:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:12:40] [INFO ] Implicit Places using invariants and state equation in 4878 ms returned []
Implicit Place search using SMT with State Equation took 5803 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:12:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:40] [INFO ] Invariant cache hit.
[2025-06-05 01:12:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:00] [INFO ] Deduced a trap composed of 175 places in 245 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:00] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:01] [INFO ] Deduced a trap composed of 175 places in 232 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:01] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:01] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:01] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:09] [INFO ] Deduced a trap composed of 107 places in 205 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:09] [INFO ] Deduced a trap composed of 205 places in 180 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:09] [INFO ] Deduced a trap composed of 107 places in 205 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:10] [INFO ] Deduced a trap composed of 205 places in 185 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:10] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:10] [INFO ] Deduced a trap composed of 205 places in 179 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:10] [INFO ] Deduced a trap composed of 107 places in 212 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:10] [INFO ] Deduced a trap composed of 205 places in 188 ms of which 40 ms to minimize.
SMT process timed out in 30499ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30503ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56664 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 01:13:11] [INFO ] Flatten gal took : 18 ms
[2025-06-05 01:13:11] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:13:11] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 01:13:11] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:13:11] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:13:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2139713086006599975.gal : 3 ms
[2025-06-05 01:13:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6173588564920102046.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/CTLFireability2139713086006599975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6173588564920102046.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-05 01:13:41] [INFO ] Flatten gal took : 22 ms
[2025-06-05 01:13:41] [INFO ] Applying decomposition
[2025-06-05 01:13:41] [INFO ] Flatten gal took : 20 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/graph11837820590462964312.txt' '-o' '/tmp/graph11837820590462964312.bin' '-w' '/tmp/graph11837820590462964312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11837820590462964312.bin' '-l' '-1' '-v' '-w' '/tmp/graph11837820590462964312.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:13:41] [INFO ] Decomposing Gal with order
[2025-06-05 01:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:13:41] [INFO ] Removed a total of 751 redundant transitions.
[2025-06-05 01:13:41] [INFO ] Flatten gal took : 34 ms
[2025-06-05 01:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2025-06-05 01:13:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4021754125703422248.gal : 5 ms
[2025-06-05 01:13:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17218028161038980274.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/CTLFireability4021754125703422248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17218028161038980274.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 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 24 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:14:11] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:11] [INFO ] Invariant cache hit.
[2025-06-05 01:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:31] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:31] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:31] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 82 ms to minimize.
SMT process timed out in 20398ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20399ms
[2025-06-05 01:14:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:14:32] [INFO ] Implicit Places using invariants in 887 ms returned []
[2025-06-05 01:14:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:14:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:14:37] [INFO ] Implicit Places using invariants and state equation in 4988 ms returned []
Implicit Place search using SMT with State Equation took 5876 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:14:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:37] [INFO ] Invariant cache hit.
[2025-06-05 01:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:57] [INFO ] Deduced a trap composed of 175 places in 228 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:58] [INFO ] Deduced a trap composed of 175 places in 233 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:58] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:58] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:58] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:59] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:06] [INFO ] Deduced a trap composed of 107 places in 210 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:06] [INFO ] Deduced a trap composed of 205 places in 185 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:07] [INFO ] Deduced a trap composed of 107 places in 199 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:07] [INFO ] Deduced a trap composed of 205 places in 187 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:07] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:07] [INFO ] Deduced a trap composed of 205 places in 179 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:07] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:08] [INFO ] Deduced a trap composed of 205 places in 184 ms of which 40 ms to minimize.
SMT process timed out in 30415ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30419ms
Starting structural reductions in LTL mode, iteration 1 : 483/485 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56723 ms. Remains : 483/485 places, 649/650 transitions.
[2025-06-05 01:15:08] [INFO ] Flatten gal took : 21 ms
[2025-06-05 01:15:08] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:15:08] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-05 01:15:08] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:15:08] [INFO ] Flatten gal took : 19 ms
[2025-06-05 01:15:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17968349383411134132.gal : 3 ms
[2025-06-05 01:15:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14716500743927845717.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/CTLFireability17968349383411134132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14716500743927845717.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.
Detected timeout of ITS tools.
[2025-06-05 01:15:38] [INFO ] Flatten gal took : 23 ms
[2025-06-05 01:15:38] [INFO ] Applying decomposition
[2025-06-05 01:15:38] [INFO ] Flatten gal took : 20 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/graph18369972772605792423.txt' '-o' '/tmp/graph18369972772605792423.bin' '-w' '/tmp/graph18369972772605792423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18369972772605792423.bin' '-l' '-1' '-v' '-w' '/tmp/graph18369972772605792423.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:15:38] [INFO ] Decomposing Gal with order
[2025-06-05 01:15:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:15:38] [INFO ] Removed a total of 751 redundant transitions.
[2025-06-05 01:15:38] [INFO ] Flatten gal took : 52 ms
[2025-06-05 01:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2025-06-05 01:15:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17790180316303096176.gal : 5 ms
[2025-06-05 01:15:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1818741041477791541.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/CTLFireability17790180316303096176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1818741041477791541.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-05 01:16:08] [INFO ] Flatten gal took : 27 ms
[2025-06-05 01:16:08] [INFO ] Flatten gal took : 27 ms
[2025-06-05 01:16:08] [INFO ] Applying decomposition
[2025-06-05 01:16:08] [INFO ] Flatten gal took : 27 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/graph5582206575418806311.txt' '-o' '/tmp/graph5582206575418806311.bin' '-w' '/tmp/graph5582206575418806311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5582206575418806311.bin' '-l' '-1' '-v' '-w' '/tmp/graph5582206575418806311.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:16:08] [INFO ] Decomposing Gal with order
[2025-06-05 01:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:16:08] [INFO ] Removed a total of 779 redundant transitions.
[2025-06-05 01:16:09] [INFO ] Flatten gal took : 55 ms
[2025-06-05 01:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-06-05 01:16:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13090305247972200273.gal : 5 ms
[2025-06-05 01:16:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17724633947361543184.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/CTLFireability13090305247972200273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17724633947361543184.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 14 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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="PolyORBNT-PT-S05J30"
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 PolyORBNT-PT-S05J30, 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 r156-tall-174881254400642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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 ;