About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T06
| 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???? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254000410.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 PolyORBLF-PT-S02J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254000410
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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.3K 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 51K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 862K 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 PolyORBLF-PT-S02J04T06-CTLFireability-2025-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748969171981
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 16:46:13] [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-03 16:46:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 16:46:13] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-06-03 16:46:13] [INFO ] Transformed 476 places.
[2025-06-03 16:46:13] [INFO ] Transformed 920 transitions.
[2025-06-03 16:46:13] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2025-06-03 16:46:13] [INFO ] Reduced 66 identical enabling conditions.
[2025-06-03 16:46:13] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-03 16:46:13] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 370 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Applied a total of 0 rules in 21 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-03 16:46:13] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-03 16:46:13] [INFO ] Computed 46 invariants in 41 ms
[2025-06-03 16:46:13] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:21] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:21] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:21] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:21] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:21] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:21] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:22] [INFO ] Deduced a trap composed of 260 places in 237 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:22] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:23] [INFO ] Deduced a trap composed of 133 places in 237 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:23] [INFO ] Deduced a trap composed of 229 places in 232 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:23] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:24] [INFO ] Deduced a trap composed of 223 places in 256 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:25] [INFO ] Deduced a trap composed of 252 places in 220 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:25] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:28] [INFO ] Deduced a trap composed of 235 places in 250 ms of which 79 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 51 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 51 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40738ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40761ms
[2025-06-03 16:46:54] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:46:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:46:54] [INFO ] Implicit Places using invariants in 207 ms returned [113, 241, 279, 282, 424, 436]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 219 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/476 places, 824/824 transitions.
Applied a total of 0 rules in 10 ms. Remains 470 /470 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41068 ms. Remains : 470/476 places, 824/824 transitions.
Support contains 370 out of 470 places after structural reductions.
[2025-06-03 16:46:54] [INFO ] Flatten gal took : 120 ms
[2025-06-03 16:46:55] [INFO ] Flatten gal took : 85 ms
[2025-06-03 16:46:55] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 346 out of 470 places (down from 370) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 2068 ms. (19 steps per ms) remains 18/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 236 ms. (16 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 17/17 properties
[2025-06-03 16:46:56] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 470 cols
[2025-06-03 16:46:56] [INFO ] Computed 40 invariants in 19 ms
[2025-06-03 16:46:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 251/398 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/399 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 7 (OVERLAPS) 71/470 variables, 22/40 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/40 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 812/1282 variables, 470/510 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1282 variables, 72/582 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1282 variables, 0/582 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1282 variables, 0/582 constraints. Problems are: Problem set: 12 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1282/1282 variables, and 582 constraints, problems are : Problem set: 12 solved, 5 unsolved in 4934 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 470/470 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 17/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 306/360 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 2/11 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/11 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/364 variables, 4/15 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 102/466 variables, 22/37 constraints. Problems are: Problem set: 12 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:02] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:02] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:02] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:03] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:03] [INFO ] Deduced a trap composed of 223 places in 276 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:03] [INFO ] Deduced a trap composed of 185 places in 225 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:03] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:04] [INFO ] Deduced a trap composed of 211 places in 277 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:04] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 9/46 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/46 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/468 variables, 2/48 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/48 constraints. Problems are: Problem set: 12 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 812/1280 variables, 468/516 constraints. Problems are: Problem set: 12 solved, 5 unsolved
SMT process timed out in 10015ms, After SMT, problems are : Problem set: 12 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 420 transition count 776
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 98 place count 420 transition count 758
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 134 place count 402 transition count 758
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 138 place count 398 transition count 754
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 398 transition count 754
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 238 place count 350 transition count 706
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 250 place count 350 transition count 694
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 262 place count 338 transition count 694
Applied a total of 262 rules in 173 ms. Remains 338 /470 variables (removed 132) and now considering 694/824 (removed 130) transitions.
Running 692 sub problems to find dead transitions.
[2025-06-03 16:47:06] [INFO ] Flow matrix only has 682 transitions (discarded 12 similar events)
// Phase 1: matrix 682 rows 338 cols
[2025-06-03 16:47:06] [INFO ] Computed 38 invariants in 12 ms
[2025-06-03 16:47:06] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:11] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:11] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:11] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:11] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:11] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:11] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:12] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:12] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:12] [INFO ] Deduced a trap composed of 127 places in 201 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:13] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:14] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:14] [INFO ] Deduced a trap composed of 202 places in 205 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:15] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:17] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:17] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:25] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/1020 variables, and 52 constraints, problems are : Problem set: 0 solved, 692 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/338 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:43] [INFO ] Deduced a trap composed of 133 places in 208 ms of which 61 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 Int declared 336/1020 variables, and 53 constraints, problems are : Problem set: 0 solved, 692 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/338 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/692 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40464ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 40467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40642 ms. Remains : 338/470 places, 694/824 transitions.
RANDOM walk for 40001 steps (26 resets) in 536 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (14 resets) in 434 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (17 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (13 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (12 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 183099 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 5
Probabilistic random walk after 183099 steps, saw 100047 distinct states, run finished after 3007 ms. (steps per millisecond=60 ) properties seen :0
[2025-06-03 16:47:50] [INFO ] Flow matrix only has 682 transitions (discarded 12 similar events)
[2025-06-03 16:47:50] [INFO ] Invariant cache hit.
[2025-06-03 16:47:50] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 194/248 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/252 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 82/334 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/336 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 682/1018 variables, 336/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1018 variables, 72/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1018 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1020 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1020 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1020 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1020 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 448 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 338/338 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 194/248 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:53] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/252 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 82/334 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:53] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:54] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:54] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:54] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:54] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:55] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:55] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/336 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 682/1018 variables, 336/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1018 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1018 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1018 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1020 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 47789ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 694/694 transitions.
Applied a total of 0 rules in 23 ms. Remains 338 /338 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 338/338 places, 694/694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 694/694 transitions.
Applied a total of 0 rules in 15 ms. Remains 338 /338 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2025-06-03 16:48:38] [INFO ] Flow matrix only has 682 transitions (discarded 12 similar events)
[2025-06-03 16:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:48:39] [INFO ] Implicit Places using invariants in 917 ms returned []
[2025-06-03 16:48:39] [INFO ] Flow matrix only has 682 transitions (discarded 12 similar events)
[2025-06-03 16:48:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:48:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:48:43] [INFO ] Implicit Places using invariants and state equation in 3879 ms returned []
Implicit Place search using SMT with State Equation took 4802 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:48:43] [INFO ] Redundant transitions in 39 ms returned []
Running 692 sub problems to find dead transitions.
[2025-06-03 16:48:43] [INFO ] Flow matrix only has 682 transitions (discarded 12 similar events)
[2025-06-03 16:48:43] [INFO ] Invariant cache hit.
[2025-06-03 16:48:43] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:48] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:48] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:48] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:48] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:49] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:49] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:50] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:50] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:50] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:51] [INFO ] Deduced a trap composed of 202 places in 195 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:52] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:53] [INFO ] Deduced a trap composed of 127 places in 191 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:54] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:54] [INFO ] Deduced a trap composed of 146 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:55] [INFO ] Deduced a trap composed of 133 places in 237 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:48:55] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 45 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 2/338 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/1020 variables, and 55 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/338 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 692 unsolved
SMT process timed out in 60430ms, After SMT, problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65306 ms. Remains : 338/338 places, 694/694 transitions.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2025-06-03 16:49:43] [INFO ] Flatten gal took : 51 ms
[2025-06-03 16:49:43] [INFO ] Flatten gal took : 46 ms
[2025-06-03 16:49:43] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 318 out of 470 places (down from 322) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 41 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:49:43] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 16:49:43] [INFO ] Computed 38 invariants in 15 ms
[2025-06-03 16:49:43] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:50] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:51] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:51] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:51] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:51] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:51] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:51] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:52] [INFO ] Deduced a trap composed of 121 places in 215 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:52] [INFO ] Deduced a trap composed of 210 places in 264 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:52] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:53] [INFO ] Deduced a trap composed of 222 places in 272 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:53] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:55] [INFO ] Deduced a trap composed of 217 places in 233 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:56] [INFO ] Deduced a trap composed of 298 places in 253 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:57] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:57] [INFO ] Deduced a trap composed of 227 places in 262 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:57] [INFO ] Deduced a trap composed of 210 places in 251 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:00] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:02] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40465ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40467ms
[2025-06-03 16:50:24] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:25] [INFO ] Implicit Places using invariants in 766 ms returned []
[2025-06-03 16:50:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:50:34] [INFO ] Implicit Places using invariants and state equation in 9122 ms returned []
Implicit Place search using SMT with State Equation took 9893 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:50:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:50:34] [INFO ] Invariant cache hit.
[2025-06-03 16:50:34] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:40] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:41] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:41] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:41] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:42] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:42] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:42] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:42] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:43] [INFO ] Deduced a trap composed of 210 places in 236 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:43] [INFO ] Deduced a trap composed of 217 places in 220 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:43] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:44] [INFO ] Deduced a trap composed of 222 places in 225 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:47] [INFO ] Deduced a trap composed of 210 places in 233 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:47] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:47] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:48] [INFO ] Deduced a trap composed of 227 places in 259 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:49] [INFO ] Deduced a trap composed of 287 places in 264 ms of which 84 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:04] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110777 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 16:51:34] [INFO ] Flatten gal took : 36 ms
[2025-06-03 16:51:34] [INFO ] Flatten gal took : 42 ms
[2025-06-03 16:51:34] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:51:34] [INFO ] Flatten gal took : 30 ms
[2025-06-03 16:51:34] [INFO ] Flatten gal took : 28 ms
[2025-06-03 16:51:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12674800984964415880.gal : 27 ms
[2025-06-03 16:51:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2904954939617986900.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/CTLFireability12674800984964415880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2904954939617986900.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-03 16:52:05] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:52:05] [INFO ] Applying decomposition
[2025-06-03 16:52:05] [INFO ] Flatten gal took : 75 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/graph369280758276017044.txt' '-o' '/tmp/graph369280758276017044.bin' '-w' '/tmp/graph369280758276017044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph369280758276017044.bin' '-l' '-1' '-v' '-w' '/tmp/graph369280758276017044.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:52:05] [INFO ] Decomposing Gal with order
[2025-06-03 16:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:52:05] [INFO ] Removed a total of 618 redundant transitions.
[2025-06-03 16:52:05] [INFO ] Flatten gal took : 127 ms
[2025-06-03 16:52:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 57 ms.
[2025-06-03 16:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10550438380500827984.gal : 25 ms
[2025-06-03 16:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12532182095853025744.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/CTLFireability10550438380500827984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12532182095853025744.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 468 transition count 800
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 444 transition count 800
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 444 transition count 788
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 432 transition count 788
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 426 transition count 782
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 426 transition count 782
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 132 place count 402 transition count 758
Applied a total of 132 rules in 58 ms. Remains 402 /470 variables (removed 68) and now considering 758/824 (removed 66) transitions.
Running 756 sub problems to find dead transitions.
[2025-06-03 16:52:35] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 402 cols
[2025-06-03 16:52:35] [INFO ] Computed 38 invariants in 12 ms
[2025-06-03 16:52:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:41] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:41] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:42] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:42] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:42] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:42] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:42] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:42] [INFO ] Deduced a trap composed of 187 places in 214 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:43] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:44] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:44] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:44] [INFO ] Deduced a trap composed of 200 places in 209 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:45] [INFO ] Deduced a trap composed of 192 places in 213 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:45] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:52:46] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 756 unsolved
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 400/1148 variables, and 45 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:13] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:14] [INFO ] Deduced a trap composed of 2 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:15] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:15] [INFO ] Deduced a trap composed of 150 places in 216 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:16] [INFO ] Deduced a trap composed of 192 places in 233 ms of which 41 ms to minimize.
SMT process timed out in 40432ms, After SMT, problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 40434ms
[2025-06-03 16:53:16] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2025-06-03 16:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:17] [INFO ] Implicit Places using invariants in 893 ms returned []
[2025-06-03 16:53:17] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2025-06-03 16:53:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:53:21] [INFO ] Implicit Places using invariants and state equation in 3895 ms returned []
Implicit Place search using SMT with State Equation took 4791 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:53:21] [INFO ] Redundant transitions in 17 ms returned []
Running 756 sub problems to find dead transitions.
[2025-06-03 16:53:21] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2025-06-03 16:53:21] [INFO ] Invariant cache hit.
[2025-06-03 16:53:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:27] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:27] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:27] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:27] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:27] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:27] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:28] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:28] [INFO ] Deduced a trap composed of 187 places in 220 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:28] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:28] [INFO ] Deduced a trap composed of 192 places in 212 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:29] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:31] [INFO ] Deduced a trap composed of 97 places in 199 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:40] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1148 variables, and 43 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:05] [INFO ] Deduced a trap composed of 200 places in 189 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:06] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:06] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:06] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:07] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:07] [INFO ] Deduced a trap composed of 102 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-03 16:54:08] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:09] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:10] [INFO ] Deduced a trap composed of 188 places in 189 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:11] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:11] [INFO ] Deduced a trap composed of 202 places in 238 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:12] [INFO ] Deduced a trap composed of 188 places in 209 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:12] [INFO ] Deduced a trap composed of 192 places in 218 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:13] [INFO ] Deduced a trap composed of 145 places in 216 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:14] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:14] [INFO ] Deduced a trap composed of 192 places in 246 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:15] [INFO ] Deduced a trap composed of 196 places in 209 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:15] [INFO ] Deduced a trap composed of 202 places in 235 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:16] [INFO ] Deduced a trap composed of 203 places in 249 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:16] [INFO ] Deduced a trap composed of 203 places in 257 ms of which 87 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1148 variables, and 63 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in SI_CTL mode, iteration 1 : 402/470 places, 758/824 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105676 ms. Remains : 402/470 places, 758/824 transitions.
[2025-06-03 16:54:21] [INFO ] Flatten gal took : 28 ms
[2025-06-03 16:54:21] [INFO ] Flatten gal took : 28 ms
[2025-06-03 16:54:21] [INFO ] Input system was already deterministic with 758 transitions.
[2025-06-03 16:54:21] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:54:21] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:54:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5475518277983214612.gal : 4 ms
[2025-06-03 16:54:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9341967012463360032.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/CTLFireability5475518277983214612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9341967012463360032.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-03 16:54:51] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:54:51] [INFO ] Applying decomposition
[2025-06-03 16:54:51] [INFO ] Flatten gal took : 26 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/graph8582743287666596945.txt' '-o' '/tmp/graph8582743287666596945.bin' '-w' '/tmp/graph8582743287666596945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8582743287666596945.bin' '-l' '-1' '-v' '-w' '/tmp/graph8582743287666596945.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:54:51] [INFO ] Decomposing Gal with order
[2025-06-03 16:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:54:52] [INFO ] Removed a total of 553 redundant transitions.
[2025-06-03 16:54:52] [INFO ] Flatten gal took : 64 ms
[2025-06-03 16:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 13 ms.
[2025-06-03 16:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15010790780012798481.gal : 7 ms
[2025-06-03 16:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12448239131933073449.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/CTLFireability15010790780012798481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12448239131933073449.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 19 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:55:22] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 16:55:22] [INFO ] Computed 38 invariants in 9 ms
[2025-06-03 16:55:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:28] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:29] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:29] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:29] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:29] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:29] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:30] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:30] [INFO ] Deduced a trap composed of 121 places in 211 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:30] [INFO ] Deduced a trap composed of 210 places in 264 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:30] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:31] [INFO ] Deduced a trap composed of 222 places in 281 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:32] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:34] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:34] [INFO ] Deduced a trap composed of 298 places in 248 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:35] [INFO ] Deduced a trap composed of 222 places in 265 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:35] [INFO ] Deduced a trap composed of 227 places in 267 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:35] [INFO ] Deduced a trap composed of 210 places in 249 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:39] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:55:40] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40397ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40399ms
[2025-06-03 16:56:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:56:03] [INFO ] Implicit Places using invariants in 434 ms returned []
[2025-06-03 16:56:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:56:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:56:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:56:09] [INFO ] Implicit Places using invariants and state equation in 6871 ms returned []
Implicit Place search using SMT with State Equation took 7307 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:56:09] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:56:09] [INFO ] Invariant cache hit.
[2025-06-03 16:56:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:16] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:16] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:17] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:17] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:17] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:17] [INFO ] Deduced a trap composed of 121 places in 237 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:18] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:18] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:18] [INFO ] Deduced a trap composed of 210 places in 237 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:19] [INFO ] Deduced a trap composed of 217 places in 234 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:19] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:19] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:22] [INFO ] Deduced a trap composed of 210 places in 222 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:23] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:23] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:23] [INFO ] Deduced a trap composed of 227 places in 253 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:24] [INFO ] Deduced a trap composed of 287 places in 251 ms of which 85 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:56:40] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108124 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 16:57:10] [INFO ] Flatten gal took : 24 ms
[2025-06-03 16:57:10] [INFO ] Flatten gal took : 23 ms
[2025-06-03 16:57:10] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:57:10] [INFO ] Flatten gal took : 23 ms
[2025-06-03 16:57:10] [INFO ] Flatten gal took : 35 ms
[2025-06-03 16:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17603721446309790921.gal : 4 ms
[2025-06-03 16:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability402895911032880239.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/CTLFireability17603721446309790921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability402895911032880239.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-03 16:57:40] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:57:40] [INFO ] Applying decomposition
[2025-06-03 16:57:40] [INFO ] Flatten gal took : 24 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/graph2733573254195311884.txt' '-o' '/tmp/graph2733573254195311884.bin' '-w' '/tmp/graph2733573254195311884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2733573254195311884.bin' '-l' '-1' '-v' '-w' '/tmp/graph2733573254195311884.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:57:40] [INFO ] Decomposing Gal with order
[2025-06-03 16:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:57:40] [INFO ] Removed a total of 632 redundant transitions.
[2025-06-03 16:57:40] [INFO ] Flatten gal took : 54 ms
[2025-06-03 16:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 14 ms.
[2025-06-03 16:57:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15282972018278395276.gal : 7 ms
[2025-06-03 16:57:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3099892815047265029.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/CTLFireability15282972018278395276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3099892815047265029.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 49 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:58:10] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:58:10] [INFO ] Invariant cache hit.
[2025-06-03 16:58:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:17] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:17] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:18] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:18] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:18] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:18] [INFO ] Deduced a trap composed of 121 places in 241 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:19] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:19] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:19] [INFO ] Deduced a trap composed of 210 places in 222 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:20] [INFO ] Deduced a trap composed of 217 places in 236 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:20] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:20] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:23] [INFO ] Deduced a trap composed of 210 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-03 16:58:24] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:24] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:24] [INFO ] Deduced a trap composed of 227 places in 239 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:58:25] [INFO ] Deduced a trap composed of 287 places in 262 ms of which 84 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40412ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40414ms
[2025-06-03 16:58:51] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:58:52] [INFO ] Implicit Places using invariants in 803 ms returned []
[2025-06-03 16:58:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:58:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:58:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:58:58] [INFO ] Implicit Places using invariants and state equation in 6028 ms returned []
Implicit Place search using SMT with State Equation took 6836 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:58:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:58:58] [INFO ] Invariant cache hit.
[2025-06-03 16:58:58] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:04] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:05] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:05] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:05] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:05] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:06] [INFO ] Deduced a trap composed of 121 places in 244 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:06] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:06] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:07] [INFO ] Deduced a trap composed of 210 places in 228 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:07] [INFO ] Deduced a trap composed of 217 places in 219 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:07] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:07] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:11] [INFO ] Deduced a trap composed of 210 places in 235 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:11] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:11] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:12] [INFO ] Deduced a trap composed of 227 places in 243 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:13] [INFO ] Deduced a trap composed of 287 places in 270 ms of which 87 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:59:28] [INFO ] Deduced a trap composed of 86 places in 226 ms of which 55 ms to minimize.
(s448 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 1.0)
(s6 0.0)
(s7 1.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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.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 1.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 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.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 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 1.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 0.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 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.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 1.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 0.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 0.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 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.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 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 3.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.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 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 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 1.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 4.0)
(s336 0.0)
(s337 7.0)
(s338 10.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.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)
(s356 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 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.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)
(s399 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 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107685 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 16:59:58] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:59:58] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:59:58] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:59:58] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:59:58] [INFO ] Flatten gal took : 23 ms
[2025-06-03 16:59:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16162205663789309110.gal : 5 ms
[2025-06-03 16:59:58] [INFO ] Time to serialize properties into /tmp/CTLFireability12484854840898123348.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/CTLFireability16162205663789309110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12484854840898123348.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-03 17:00:28] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:00:28] [INFO ] Applying decomposition
[2025-06-03 17:00:28] [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/graph3597777441942984104.txt' '-o' '/tmp/graph3597777441942984104.bin' '-w' '/tmp/graph3597777441942984104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3597777441942984104.bin' '-l' '-1' '-v' '-w' '/tmp/graph3597777441942984104.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:00:28] [INFO ] Decomposing Gal with order
[2025-06-03 17:00:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:00:28] [INFO ] Removed a total of 628 redundant transitions.
[2025-06-03 17:00:28] [INFO ] Flatten gal took : 45 ms
[2025-06-03 17:00:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 15 ms.
[2025-06-03 17:00:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3731478141073918443.gal : 7 ms
[2025-06-03 17:00:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9176192203186587341.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/CTLFireability3731478141073918443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9176192203186587341.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 SI_CTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 468 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 414 transition count 770
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 108 place count 414 transition count 752
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 144 place count 396 transition count 752
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 392 transition count 748
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 392 transition count 748
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 248 place count 344 transition count 700
Applied a total of 248 rules in 40 ms. Remains 344 /470 variables (removed 126) and now considering 700/824 (removed 124) transitions.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:00:59] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
// Phase 1: matrix 688 rows 344 cols
[2025-06-03 17:00:59] [INFO ] Computed 38 invariants in 11 ms
[2025-06-03 17:00:59] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:03] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:03] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:03] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:03] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:04] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:04] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:04] [INFO ] Deduced a trap composed of 138 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-03 17:01:04] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:04] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:04] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:06] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:06] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:10] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 43 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:38] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:38] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 40 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 45 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40388ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 40390ms
[2025-06-03 17:01:39] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:01:40] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2025-06-03 17:01:40] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:01:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:01:45] [INFO ] Implicit Places using invariants and state equation in 4405 ms returned []
Implicit Place search using SMT with State Equation took 5511 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:01:45] [INFO ] Redundant transitions in 11 ms returned []
Running 698 sub problems to find dead transitions.
[2025-06-03 17:01:45] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:01:45] [INFO ] Invariant cache hit.
[2025-06-03 17:01:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:49] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:49] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:50] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:52] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:52] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:54] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:56] [INFO ] Deduced a trap composed of 186 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-03 17:01:56] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:04] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:05] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 46 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:37] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:37] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:38] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:38] [INFO ] Deduced a trap composed of 150 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-03 17:02:38] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:38] [INFO ] Deduced a trap composed of 154 places in 223 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:38] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:39] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:39] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 72 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 55 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in SI_CTL mode, iteration 1 : 344/470 places, 700/824 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106346 ms. Remains : 344/470 places, 700/824 transitions.
[2025-06-03 17:02:45] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:02:45] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:02:45] [INFO ] Input system was already deterministic with 700 transitions.
[2025-06-03 17:02:45] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:02:45] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:02:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1389342362701242919.gal : 4 ms
[2025-06-03 17:02:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4612796377064740312.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/CTLFireability1389342362701242919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4612796377064740312.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.76324e+06,27.3454,856332,2,154643,5,1.10478e+06,6,0,2148,1.13023e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 17:03:15] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:03:15] [INFO ] Applying decomposition
[2025-06-03 17:03:15] [INFO ] Flatten gal took : 33 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/graph4990401097281101806.txt' '-o' '/tmp/graph4990401097281101806.bin' '-w' '/tmp/graph4990401097281101806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4990401097281101806.bin' '-l' '-1' '-v' '-w' '/tmp/graph4990401097281101806.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:03:15] [INFO ] Decomposing Gal with order
[2025-06-03 17:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:03:15] [INFO ] Removed a total of 486 redundant transitions.
[2025-06-03 17:03:15] [INFO ] Flatten gal took : 47 ms
[2025-06-03 17:03:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 11 ms.
[2025-06-03 17:03:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4900893272514210164.gal : 8 ms
[2025-06-03 17:03:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12606218636227108260.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/CTLFireability4900893272514210164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12606218636227108260.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Applied a total of 14 rules in 11 ms. Remains 462 /470 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-03 17:03:45] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2025-06-03 17:03:45] [INFO ] Computed 38 invariants in 14 ms
[2025-06-03 17:03:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:52] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:52] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:52] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:53] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:53] [INFO ] Deduced a trap composed of 127 places in 215 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:53] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:53] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:54] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:54] [INFO ] Deduced a trap composed of 211 places in 239 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:54] [INFO ] Deduced a trap composed of 15 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-03 17:03:55] [INFO ] Deduced a trap composed of 223 places in 238 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:55] [INFO ] Deduced a trap composed of 288 places in 273 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:57] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:58] [INFO ] Deduced a trap composed of 223 places in 265 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:59] [INFO ] Deduced a trap composed of 217 places in 235 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:59] [INFO ] Deduced a trap composed of 223 places in 233 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:00] [INFO ] Deduced a trap composed of 92 places in 227 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:01] [INFO ] Deduced a trap composed of 282 places in 339 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:01] [INFO ] Deduced a trap composed of 288 places in 263 ms of which 83 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 55 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 55 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40405ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40407ms
[2025-06-03 17:04:26] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 17:04:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:04:27] [INFO ] Implicit Places using invariants in 823 ms returned []
[2025-06-03 17:04:27] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 17:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:04:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:04:34] [INFO ] Implicit Places using invariants and state equation in 7668 ms returned []
Implicit Place search using SMT with State Equation took 8495 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2025-06-03 17:04:34] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 17:04:34] [INFO ] Invariant cache hit.
[2025-06-03 17:04:34] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:41] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:41] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:41] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:41] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:41] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:42] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:42] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:42] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 211 places in 258 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 223 places in 243 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:45] [INFO ] Deduced a trap composed of 205 places in 245 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:46] [INFO ] Deduced a trap composed of 223 places in 248 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:47] [INFO ] Deduced a trap composed of 223 places in 223 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:48] [INFO ] Deduced a trap composed of 235 places in 226 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:48] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:49] [INFO ] Deduced a trap composed of 288 places in 268 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:49] [INFO ] Deduced a trap composed of 288 places in 257 ms of which 80 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 54 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:23] [INFO ] Deduced a trap composed of 248 places in 208 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:26] [INFO ] Deduced a trap composed of 217 places in 248 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:27] [INFO ] Deduced a trap composed of 299 places in 247 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:31] [INFO ] Deduced a trap composed of 92 places in 220 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 58 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 462/470 places, 818/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109340 ms. Remains : 462/470 places, 818/824 transitions.
[2025-06-03 17:05:35] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:05:35] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:05:35] [INFO ] Input system was already deterministic with 818 transitions.
[2025-06-03 17:05:35] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:05:35] [INFO ] Flatten gal took : 23 ms
[2025-06-03 17:05:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7704989467114218316.gal : 4 ms
[2025-06-03 17:05:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11546862219306295828.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/CTLFireability7704989467114218316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11546862219306295828.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-03 17:06:05] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:06:05] [INFO ] Applying decomposition
[2025-06-03 17:06:05] [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/graph3276458944432711675.txt' '-o' '/tmp/graph3276458944432711675.bin' '-w' '/tmp/graph3276458944432711675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3276458944432711675.bin' '-l' '-1' '-v' '-w' '/tmp/graph3276458944432711675.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:06:05] [INFO ] Decomposing Gal with order
[2025-06-03 17:06:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:06:05] [INFO ] Removed a total of 579 redundant transitions.
[2025-06-03 17:06:05] [INFO ] Flatten gal took : 40 ms
[2025-06-03 17:06:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 7 ms.
[2025-06-03 17:06:05] [INFO ] Time to serialize gal into /tmp/CTLFireability872571392682928204.gal : 7 ms
[2025-06-03 17:06:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9663418911193098395.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/CTLFireability872571392682928204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9663418911193098395.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 21 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:06:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 17:06:35] [INFO ] Computed 38 invariants in 8 ms
[2025-06-03 17:06:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:42] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:42] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:43] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:43] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:43] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:43] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:43] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:43] [INFO ] Deduced a trap composed of 121 places in 220 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:44] [INFO ] Deduced a trap composed of 210 places in 251 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:44] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:45] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:45] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:47] [INFO ] Deduced a trap composed of 217 places in 238 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:48] [INFO ] Deduced a trap composed of 298 places in 255 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:48] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:49] [INFO ] Deduced a trap composed of 227 places in 267 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:49] [INFO ] Deduced a trap composed of 210 places in 258 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:52] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:54] [INFO ] Deduced a trap composed of 15 places in 143 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 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40408ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40409ms
[2025-06-03 17:07:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:07:16] [INFO ] Implicit Places using invariants in 694 ms returned []
[2025-06-03 17:07:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:07:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:07:23] [INFO ] Implicit Places using invariants and state equation in 6637 ms returned []
Implicit Place search using SMT with State Equation took 7352 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:07:23] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:07:23] [INFO ] Invariant cache hit.
[2025-06-03 17:07:23] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:30] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:30] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:30] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:30] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:31] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:31] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:31] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 210 places in 229 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 217 places in 228 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:33] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:36] [INFO ] Deduced a trap composed of 210 places in 230 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:36] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:37] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:37] [INFO ] Deduced a trap composed of 227 places in 255 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:38] [INFO ] Deduced a trap composed of 287 places in 272 ms of which 86 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:53] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108190 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 17:08:23] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:08:23] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:08:24] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 17:08:24] [INFO ] Flatten gal took : 32 ms
[2025-06-03 17:08:24] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:08:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3441049461931682032.gal : 3 ms
[2025-06-03 17:08:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12890747418854842770.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/CTLFireability3441049461931682032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12890747418854842770.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-03 17:08:54] [INFO ] Flatten gal took : 25 ms
[2025-06-03 17:08:54] [INFO ] Applying decomposition
[2025-06-03 17:08:54] [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/graph7336103607985255840.txt' '-o' '/tmp/graph7336103607985255840.bin' '-w' '/tmp/graph7336103607985255840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7336103607985255840.bin' '-l' '-1' '-v' '-w' '/tmp/graph7336103607985255840.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:08:54] [INFO ] Decomposing Gal with order
[2025-06-03 17:08:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:08:54] [INFO ] Removed a total of 697 redundant transitions.
[2025-06-03 17:08:54] [INFO ] Flatten gal took : 39 ms
[2025-06-03 17:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 7 ms.
[2025-06-03 17:08:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15718246330897600706.gal : 6 ms
[2025-06-03 17:08:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7822120918427231991.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/CTLFireability15718246330897600706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7822120918427231991.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 468 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 414 transition count 770
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 108 place count 414 transition count 752
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 144 place count 396 transition count 752
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 392 transition count 748
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 392 transition count 748
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 248 place count 344 transition count 700
Applied a total of 248 rules in 38 ms. Remains 344 /470 variables (removed 126) and now considering 700/824 (removed 124) transitions.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:09:24] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
// Phase 1: matrix 688 rows 344 cols
[2025-06-03 17:09:24] [INFO ] Computed 38 invariants in 8 ms
[2025-06-03 17:09:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:29] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:30] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:30] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:32] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:32] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:36] [INFO ] Deduced a trap composed of 180 places in 191 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 43 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:03] [INFO ] Deduced a trap composed of 112 places in 177 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:03] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 40 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 45 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40351ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 40352ms
[2025-06-03 17:10:04] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:10:05] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2025-06-03 17:10:05] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:10:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:10:10] [INFO ] Implicit Places using invariants and state equation in 4269 ms returned []
Implicit Place search using SMT with State Equation took 5347 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:10:10] [INFO ] Redundant transitions in 13 ms returned []
Running 698 sub problems to find dead transitions.
[2025-06-03 17:10:10] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:10:10] [INFO ] Invariant cache hit.
[2025-06-03 17:10:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:16] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:17] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:17] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:19] [INFO ] Deduced a trap composed of 133 places in 200 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:21] [INFO ] Deduced a trap composed of 186 places in 185 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:21] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:29] [INFO ] Deduced a trap composed of 112 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:30] [INFO ] Deduced a trap composed of 146 places in 172 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 698 unsolved
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 342/1032 variables, and 46 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:03] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:03] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:03] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:03] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:03] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:03] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:04] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:05] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:05] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 71 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 55 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Starting structural reductions in SI_CTL mode, iteration 1 : 344/470 places, 700/824 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106128 ms. Remains : 344/470 places, 700/824 transitions.
[2025-06-03 17:11:10] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:11:10] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:11:10] [INFO ] Input system was already deterministic with 700 transitions.
[2025-06-03 17:11:10] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:11:10] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:11:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9861262150652647573.gal : 3 ms
[2025-06-03 17:11:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6582751244913448558.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/CTLFireability9861262150652647573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6582751244913448558.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-03 17:11:40] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:11:40] [INFO ] Applying decomposition
[2025-06-03 17:11:40] [INFO ] Flatten gal took : 18 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/graph16868674587210768894.txt' '-o' '/tmp/graph16868674587210768894.bin' '-w' '/tmp/graph16868674587210768894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16868674587210768894.bin' '-l' '-1' '-v' '-w' '/tmp/graph16868674587210768894.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:11:40] [INFO ] Decomposing Gal with order
[2025-06-03 17:11:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:11:40] [INFO ] Removed a total of 465 redundant transitions.
[2025-06-03 17:11:40] [INFO ] Flatten gal took : 39 ms
[2025-06-03 17:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 6 ms.
[2025-06-03 17:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability818554002526442554.gal : 9 ms
[2025-06-03 17:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11494463402777968841.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/CTLFireability818554002526442554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11494463402777968841.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 463 transition count 819
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 463 transition count 819
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 458 transition count 814
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 458 transition count 814
Applied a total of 22 rules in 24 ms. Remains 458 /470 variables (removed 12) and now considering 814/824 (removed 10) transitions.
Running 812 sub problems to find dead transitions.
[2025-06-03 17:12:11] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
// Phase 1: matrix 802 rows 458 cols
[2025-06-03 17:12:11] [INFO ] Computed 38 invariants in 13 ms
[2025-06-03 17:12:11] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:17] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:17] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:18] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:18] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:18] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:19] [INFO ] Deduced a trap composed of 207 places in 231 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:19] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:19] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:19] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:19] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:20] [INFO ] Deduced a trap composed of 223 places in 235 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:21] [INFO ] Deduced a trap composed of 205 places in 256 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:22] [INFO ] Deduced a trap composed of 219 places in 278 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:23] [INFO ] Deduced a trap composed of 217 places in 286 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:24] [INFO ] Deduced a trap composed of 223 places in 266 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:24] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1260 variables, and 52 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/458 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/1260 variables, and 52 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/458 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/812 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40396ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 40398ms
[2025-06-03 17:12:51] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2025-06-03 17:12:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:12:52] [INFO ] Implicit Places using invariants in 720 ms returned []
[2025-06-03 17:12:52] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2025-06-03 17:12:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:12:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:12:57] [INFO ] Implicit Places using invariants and state equation in 5710 ms returned []
Implicit Place search using SMT with State Equation took 6441 ms to find 0 implicit places.
Running 812 sub problems to find dead transitions.
[2025-06-03 17:12:57] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2025-06-03 17:12:57] [INFO ] Invariant cache hit.
[2025-06-03 17:12:57] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:04] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:04] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:04] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:05] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:05] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:05] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:06] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:06] [INFO ] Deduced a trap composed of 202 places in 240 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:06] [INFO ] Deduced a trap composed of 207 places in 239 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:06] [INFO ] Deduced a trap composed of 15 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-03 17:13:07] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:07] [INFO ] Deduced a trap composed of 223 places in 246 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:09] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:10] [INFO ] Deduced a trap composed of 219 places in 269 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:10] [INFO ] Deduced a trap composed of 299 places in 258 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:11] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:11] [INFO ] Deduced a trap composed of 217 places in 239 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:11] [INFO ] Deduced a trap composed of 223 places in 239 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:13] [INFO ] Deduced a trap composed of 284 places in 264 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:14] [INFO ] Deduced a trap composed of 88 places in 203 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:22] [INFO ] Deduced a trap composed of 244 places in 221 ms of which 54 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1260 variables, and 57 constraints, problems are : Problem set: 0 solved, 812 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/458 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/1260 variables, and 57 constraints, problems are : Problem set: 0 solved, 812 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/458 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/812 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in LTL mode, iteration 1 : 458/470 places, 814/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107243 ms. Remains : 458/470 places, 814/824 transitions.
[2025-06-03 17:13:58] [INFO ] Flatten gal took : 27 ms
[2025-06-03 17:13:58] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:13:58] [INFO ] Input system was already deterministic with 814 transitions.
[2025-06-03 17:13:58] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:13:58] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:13:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5695926172566270771.gal : 4 ms
[2025-06-03 17:13:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15546302225058121961.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/CTLFireability5695926172566270771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15546302225058121961.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-03 17:14:28] [INFO ] Flatten gal took : 23 ms
[2025-06-03 17:14:28] [INFO ] Applying decomposition
[2025-06-03 17:14:28] [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/graph13111046481023770876.txt' '-o' '/tmp/graph13111046481023770876.bin' '-w' '/tmp/graph13111046481023770876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13111046481023770876.bin' '-l' '-1' '-v' '-w' '/tmp/graph13111046481023770876.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:14:28] [INFO ] Decomposing Gal with order
[2025-06-03 17:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:14:28] [INFO ] Removed a total of 646 redundant transitions.
[2025-06-03 17:14:28] [INFO ] Flatten gal took : 36 ms
[2025-06-03 17:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 7 ms.
[2025-06-03 17:14:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1339032606150981016.gal : 5 ms
[2025-06-03 17:14:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4884868457765082027.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/CTLFireability1339032606150981016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4884868457765082027.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 19 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:14:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 17:14:58] [INFO ] Computed 38 invariants in 15 ms
[2025-06-03 17:14:58] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:05] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:05] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:05] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:06] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:06] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:06] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:06] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:06] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:07] [INFO ] Deduced a trap composed of 210 places in 247 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:07] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:08] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:08] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:10] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:11] [INFO ] Deduced a trap composed of 298 places in 236 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:11] [INFO ] Deduced a trap composed of 222 places in 245 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:12] [INFO ] Deduced a trap composed of 227 places in 268 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:12] [INFO ] Deduced a trap composed of 210 places in 260 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:15] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:17] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 14 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.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 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 3.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 1.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 0.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 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.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 1.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 0.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 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.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 1.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 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.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 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.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 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.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 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 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 1.0)
(s325 1.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 5.0)
(s336 0.0)
(s337 9.0)
(s338 6.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.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)
(s356 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 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.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)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40415ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40416ms
[2025-06-03 17:15:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:15:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:15:40] [INFO ] Implicit Places using invariants in 866 ms returned []
[2025-06-03 17:15:40] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:15:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:15:44] [INFO ] Implicit Places using invariants and state equation in 4324 ms returned []
Implicit Place search using SMT with State Equation took 5194 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:15:44] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:15:44] [INFO ] Invariant cache hit.
[2025-06-03 17:15:44] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:51] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:51] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:51] [INFO ] Deduced a trap composed of 64 places in 218 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:51] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:52] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:52] [INFO ] Deduced a trap composed of 121 places in 239 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:52] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:53] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:53] [INFO ] Deduced a trap composed of 210 places in 239 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:53] [INFO ] Deduced a trap composed of 217 places in 234 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:53] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:54] [INFO ] Deduced a trap composed of 222 places in 240 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:57] [INFO ] Deduced a trap composed of 210 places in 214 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:57] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:58] [INFO ] Deduced a trap composed of 222 places in 248 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:58] [INFO ] Deduced a trap composed of 227 places in 252 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:59] [INFO ] Deduced a trap composed of 287 places in 265 ms of which 84 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:14] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106033 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 17:16:44] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:16:44] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:16:44] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 17:16:44] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:16:44] [INFO ] Flatten gal took : 27 ms
[2025-06-03 17:16:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17438952338469503735.gal : 4 ms
[2025-06-03 17:16:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13948083937754766244.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/CTLFireability17438952338469503735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13948083937754766244.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-03 17:17:14] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:17:14] [INFO ] Applying decomposition
[2025-06-03 17:17:14] [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/graph1083727310871618159.txt' '-o' '/tmp/graph1083727310871618159.bin' '-w' '/tmp/graph1083727310871618159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1083727310871618159.bin' '-l' '-1' '-v' '-w' '/tmp/graph1083727310871618159.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:17:15] [INFO ] Decomposing Gal with order
[2025-06-03 17:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:17:15] [INFO ] Removed a total of 587 redundant transitions.
[2025-06-03 17:17:15] [INFO ] Flatten gal took : 44 ms
[2025-06-03 17:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 8 ms.
[2025-06-03 17:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2389129837171703379.gal : 5 ms
[2025-06-03 17:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5001604825392581501.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/CTLFireability2389129837171703379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5001604825392581501.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 19 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:17:45] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:17:45] [INFO ] Invariant cache hit.
[2025-06-03 17:17:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:52] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:52] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:52] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:52] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:53] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:53] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:53] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:54] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:54] [INFO ] Deduced a trap composed of 210 places in 241 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:54] [INFO ] Deduced a trap composed of 217 places in 234 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:54] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:55] [INFO ] Deduced a trap composed of 222 places in 241 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:58] [INFO ] Deduced a trap composed of 210 places in 234 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:58] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:59] [INFO ] Deduced a trap composed of 222 places in 247 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:59] [INFO ] Deduced a trap composed of 227 places in 257 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:00] [INFO ] Deduced a trap composed of 287 places in 255 ms of which 84 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40399ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40401ms
[2025-06-03 17:18:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:18:26] [INFO ] Implicit Places using invariants in 816 ms returned []
[2025-06-03 17:18:26] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:18:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:18:32] [INFO ] Implicit Places using invariants and state equation in 5878 ms returned []
Implicit Place search using SMT with State Equation took 6703 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:18:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:18:32] [INFO ] Invariant cache hit.
[2025-06-03 17:18:32] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:39] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:39] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:39] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:39] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:40] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:40] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:40] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:41] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:41] [INFO ] Deduced a trap composed of 210 places in 240 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:41] [INFO ] Deduced a trap composed of 217 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:41] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:42] [INFO ] Deduced a trap composed of 222 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:45] [INFO ] Deduced a trap composed of 210 places in 234 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:45] [INFO ] Deduced a trap composed of 42 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-03 17:18:45] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:46] [INFO ] Deduced a trap composed of 227 places in 255 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:47] [INFO ] Deduced a trap composed of 287 places in 250 ms of which 85 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:02] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107526 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 17:19:32] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:19:32] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:19:32] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 17:19:32] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:19:32] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:19:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11987988911557793214.gal : 4 ms
[2025-06-03 17:19:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7952124940349731632.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/CTLFireability11987988911557793214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7952124940349731632.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-03 17:20:02] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:20:02] [INFO ] Applying decomposition
[2025-06-03 17:20:02] [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/graph13630672659174859080.txt' '-o' '/tmp/graph13630672659174859080.bin' '-w' '/tmp/graph13630672659174859080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13630672659174859080.bin' '-l' '-1' '-v' '-w' '/tmp/graph13630672659174859080.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:20:03] [INFO ] Decomposing Gal with order
[2025-06-03 17:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:20:03] [INFO ] Removed a total of 669 redundant transitions.
[2025-06-03 17:20:03] [INFO ] Flatten gal took : 36 ms
[2025-06-03 17:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 6 ms.
[2025-06-03 17:20:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3128274650346323956.gal : 5 ms
[2025-06-03 17:20:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11096829483133433800.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/CTLFireability3128274650346323956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11096829483133433800.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 96 place count 420 transition count 722
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 204 place count 366 transition count 722
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 208 place count 362 transition count 718
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 362 transition count 718
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 272 place count 332 transition count 688
Applied a total of 272 rules in 49 ms. Remains 332 /470 variables (removed 138) and now considering 688/824 (removed 136) transitions.
Running 686 sub problems to find dead transitions.
[2025-06-03 17:20:33] [INFO ] Flow matrix only has 676 transitions (discarded 12 similar events)
// Phase 1: matrix 676 rows 332 cols
[2025-06-03 17:20:33] [INFO ] Computed 38 invariants in 16 ms
[2025-06-03 17:20:33] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 686 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 15 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-03 17:20:38] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:39] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:40] [INFO ] Deduced a trap composed of 115 places in 194 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:42] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:42] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:44] [INFO ] Deduced a trap composed of 180 places in 190 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:45] [INFO ] Deduced a trap composed of 94 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-03 17:20:46] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 686 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 330/1008 variables, and 52 constraints, problems are : Problem set: 0 solved, 686 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/332 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 686/686 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 686 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 686 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 686 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:02] [INFO ] Deduced a trap composed of 127 places in 174 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:02] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:03] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 38 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/1008 variables, and 55 constraints, problems are : Problem set: 0 solved, 686 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/332 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/686 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40374ms problems are : Problem set: 0 solved, 686 unsolved
Search for dead transitions found 0 dead transitions in 40375ms
[2025-06-03 17:21:13] [INFO ] Flow matrix only has 676 transitions (discarded 12 similar events)
[2025-06-03 17:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:21:14] [INFO ] Implicit Places using invariants in 858 ms returned []
[2025-06-03 17:21:14] [INFO ] Flow matrix only has 676 transitions (discarded 12 similar events)
[2025-06-03 17:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:21:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:21:20] [INFO ] Implicit Places using invariants and state equation in 5905 ms returned []
Implicit Place search using SMT with State Equation took 6769 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:21:20] [INFO ] Redundant transitions in 13 ms returned []
Running 686 sub problems to find dead transitions.
[2025-06-03 17:21:20] [INFO ] Flow matrix only has 676 transitions (discarded 12 similar events)
[2025-06-03 17:21:20] [INFO ] Invariant cache hit.
[2025-06-03 17:21:20] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 686 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 15 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-03 17:21:25] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:25] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:26] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:26] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:27] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:28] [INFO ] Deduced a trap composed of 115 places in 196 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:30] [INFO ] Deduced a trap composed of 127 places in 200 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:30] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:32] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:33] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 686 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 686 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/332 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:50] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:50] [INFO ] Deduced a trap composed of 112 places in 174 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/1008 variables, and 56 constraints, problems are : Problem set: 66 solved, 620 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/332 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 686/686 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 620 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 25/36 constraints. Problems are: Problem set: 66 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 16/52 constraints. Problems are: Problem set: 66 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/52 constraints. Problems are: Problem set: 66 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 2/332 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 620 unsolved
SMT process timed out in 60371ms, After SMT, problems are : Problem set: 66 solved, 620 unsolved
Search for dead transitions found 66 dead transitions in 60373ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 332/470 places, 622/824 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 318 transition count 598
Applied a total of 12 rules in 25 ms. Remains 318 /332 variables (removed 14) and now considering 598/622 (removed 24) transitions.
[2025-06-03 17:22:20] [INFO ] Flow matrix only has 586 transitions (discarded 12 similar events)
// Phase 1: matrix 586 rows 318 cols
[2025-06-03 17:22:20] [INFO ] Computed 38 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:22:21] [INFO ] Implicit Places using invariants in 931 ms returned []
[2025-06-03 17:22:21] [INFO ] Flow matrix only has 586 transitions (discarded 12 similar events)
[2025-06-03 17:22:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:22:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:22:26] [INFO ] Implicit Places using invariants and state equation in 4694 ms returned []
Implicit Place search using SMT with State Equation took 5634 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 318/470 places, 598/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 113252 ms. Remains : 318/470 places, 598/824 transitions.
[2025-06-03 17:22:26] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:22:26] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:22:26] [INFO ] Input system was already deterministic with 598 transitions.
RANDOM walk for 1797 steps (0 resets) in 24 ms. (71 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T06-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 17:22:26] [INFO ] Flatten gal took : 23 ms
[2025-06-03 17:22:26] [INFO ] Flatten gal took : 16 ms
[2025-06-03 17:22:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15724632845135084381.gal : 3 ms
[2025-06-03 17:22:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3855113232810494527.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15724632845135084381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3855113232810494527.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 15 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:22:26] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 17:22:26] [INFO ] Computed 38 invariants in 12 ms
[2025-06-03 17:22:26] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:33] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:33] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:33] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:33] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:34] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:34] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:34] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:34] [INFO ] Deduced a trap composed of 121 places in 199 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:35] [INFO ] Deduced a trap composed of 210 places in 243 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:35] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:36] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:36] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:38] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:38] [INFO ] Deduced a trap composed of 298 places in 232 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:39] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:40] [INFO ] Deduced a trap composed of 227 places in 252 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:40] [INFO ] Deduced a trap composed of 210 places in 239 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:43] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:44] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40401ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40403ms
[2025-06-03 17:23:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:23:07] [INFO ] Implicit Places using invariants in 801 ms returned []
[2025-06-03 17:23:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:23:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:23:14] [INFO ] Implicit Places using invariants and state equation in 6295 ms returned []
Implicit Place search using SMT with State Equation took 7100 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:23:14] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:23:14] [INFO ] Invariant cache hit.
[2025-06-03 17:23:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:20] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:21] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:21] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:21] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:21] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:22] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:22] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:22] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:23] [INFO ] Deduced a trap composed of 210 places in 261 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:23] [INFO ] Deduced a trap composed of 217 places in 226 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:23] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:23] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:27] [INFO ] Deduced a trap composed of 210 places in 234 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:27] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:27] [INFO ] Deduced a trap composed of 222 places in 246 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:28] [INFO ] Deduced a trap composed of 227 places in 263 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:29] [INFO ] Deduced a trap composed of 287 places in 261 ms of which 85 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:44] [INFO ] Deduced a trap composed of 86 places in 228 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107906 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 17:24:14] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:24:14] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:24:14] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 17:24:14] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:24:14] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:24:14] [INFO ] Time to serialize gal into /tmp/CTLFireability48211261820115807.gal : 3 ms
[2025-06-03 17:24:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15551876992889030429.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/CTLFireability48211261820115807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15551876992889030429.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:24:44] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:24:44] [INFO ] Applying decomposition
[2025-06-03 17:24:44] [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/graph7192346793487625553.txt' '-o' '/tmp/graph7192346793487625553.bin' '-w' '/tmp/graph7192346793487625553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7192346793487625553.bin' '-l' '-1' '-v' '-w' '/tmp/graph7192346793487625553.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:24:44] [INFO ] Decomposing Gal with order
[2025-06-03 17:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:24:44] [INFO ] Removed a total of 648 redundant transitions.
[2025-06-03 17:24:44] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 14 ms.
[2025-06-03 17:24:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16134660782362117471.gal : 6 ms
[2025-06-03 17:24:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16278760516121410118.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/CTLFireability16134660782362117471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16278760516121410118.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 468 transition count 772
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 416 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 415 transition count 771
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 106 place count 415 transition count 726
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 196 place count 370 transition count 726
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 366 transition count 722
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 300 place count 318 transition count 674
Applied a total of 300 rules in 51 ms. Remains 318 /470 variables (removed 152) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2025-06-03 17:25:15] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2025-06-03 17:25:15] [INFO ] Computed 38 invariants in 19 ms
[2025-06-03 17:25:15] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:19] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:19] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:19] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:19] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:19] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:19] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:20] [INFO ] Deduced a trap composed of 25 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-03 17:25:21] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:21] [INFO ] Deduced a trap composed of 42 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-03 17:25:21] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:22] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:23] [INFO ] Deduced a trap composed of 112 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-03 17:25:24] [INFO ] Deduced a trap composed of 117 places in 193 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:24] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:25] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:26] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:32] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:33] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 33 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 (/ 2.0 3.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 (/ 2.0 3.0))
(s24 1.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 0.0)
(s38 1.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 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.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 1.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 0.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 3.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 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.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 1.0)
(s168 (/ 1.0 3.0))
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 4.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.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 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.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)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 2.0)
(s236 6.0)
(s237 9.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.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 0.0)
(s254 0.0)
(s255 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 54 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:44] [INFO ] Deduced a trap composed of 181 places in 172 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/980 variables, and 55 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40417ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 40420ms
[2025-06-03 17:25:55] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-03 17:25:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:25:56] [INFO ] Implicit Places using invariants in 831 ms returned []
[2025-06-03 17:25:56] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-03 17:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:25:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:26:01] [INFO ] Implicit Places using invariants and state equation in 4916 ms returned []
Implicit Place search using SMT with State Equation took 5750 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:26:01] [INFO ] Redundant transitions in 12 ms returned []
Running 672 sub problems to find dead transitions.
[2025-06-03 17:26:01] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-03 17:26:01] [INFO ] Invariant cache hit.
[2025-06-03 17:26:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:05] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:05] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:06] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:07] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:07] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:11] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:11] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:12] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:12] [INFO ] Deduced a trap composed of 112 places in 209 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:17] [INFO ] Deduced a trap composed of 117 places in 189 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:18] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:26] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 1.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 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 (/ 2.0 3.0))
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.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 1.0)
(s63 0.0)
(s64 0.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 0.0)
(s77 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 316/980 variables, and 56 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 60360ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in SI_CTL mode, iteration 1 : 318/470 places, 674/824 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106607 ms. Remains : 318/470 places, 674/824 transitions.
[2025-06-03 17:27:01] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:27:01] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:27:01] [INFO ] Input system was already deterministic with 674 transitions.
[2025-06-03 17:27:01] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:27:01] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11847566524101174370.gal : 3 ms
[2025-06-03 17:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6967091831021817403.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/CTLFireability11847566524101174370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6967091831021817403.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-03 17:27:31] [INFO ] Flatten gal took : 40 ms
[2025-06-03 17:27:31] [INFO ] Applying decomposition
[2025-06-03 17:27:31] [INFO ] Flatten gal took : 35 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/graph17241833888037492211.txt' '-o' '/tmp/graph17241833888037492211.bin' '-w' '/tmp/graph17241833888037492211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17241833888037492211.bin' '-l' '-1' '-v' '-w' '/tmp/graph17241833888037492211.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:27:31] [INFO ] Decomposing Gal with order
[2025-06-03 17:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:27:31] [INFO ] Removed a total of 464 redundant transitions.
[2025-06-03 17:27:31] [INFO ] Flatten gal took : 41 ms
[2025-06-03 17:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 5 ms.
[2025-06-03 17:27:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2409113054626925256.gal : 14 ms
[2025-06-03 17:27:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15541380653767451699.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/CTLFireability2409113054626925256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15541380653767451699.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 468 transition count 784
Reduce places removed 40 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 428 transition count 777
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 421 transition count 777
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 94 place count 421 transition count 724
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 200 place count 368 transition count 724
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 204 place count 364 transition count 720
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 364 transition count 720
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 268 place count 334 transition count 690
Applied a total of 268 rules in 49 ms. Remains 334 /470 variables (removed 136) and now considering 690/824 (removed 134) transitions.
Running 688 sub problems to find dead transitions.
[2025-06-03 17:28:02] [INFO ] Flow matrix only has 678 transitions (discarded 12 similar events)
// Phase 1: matrix 678 rows 334 cols
[2025-06-03 17:28:02] [INFO ] Computed 38 invariants in 7 ms
[2025-06-03 17:28:02] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:06] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 116 places in 170 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:07] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:08] [INFO ] Deduced a trap composed of 25 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-03 17:28:09] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:09] [INFO ] Deduced a trap composed of 121 places in 206 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:11] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:11] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:13] [INFO ] Deduced a trap composed of 182 places in 239 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:14] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:14] [INFO ] Deduced a trap composed of 130 places in 187 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:19] [INFO ] Deduced a trap composed of 128 places in 215 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:19] [INFO ] Deduced a trap composed of 133 places in 207 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:21] [INFO ] Deduced a trap composed of 170 places in 176 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/1012 variables, and 55 constraints, problems are : Problem set: 0 solved, 688 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/334 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/1012 variables, and 55 constraints, problems are : Problem set: 0 solved, 688 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/334 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/688 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40469ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 40470ms
[2025-06-03 17:28:42] [INFO ] Flow matrix only has 678 transitions (discarded 12 similar events)
[2025-06-03 17:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:28:43] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2025-06-03 17:28:43] [INFO ] Flow matrix only has 678 transitions (discarded 12 similar events)
[2025-06-03 17:28:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:28:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:28:48] [INFO ] Implicit Places using invariants and state equation in 5055 ms returned []
Implicit Place search using SMT with State Equation took 6089 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:28:48] [INFO ] Redundant transitions in 6 ms returned []
Running 688 sub problems to find dead transitions.
[2025-06-03 17:28:48] [INFO ] Flow matrix only has 678 transitions (discarded 12 similar events)
[2025-06-03 17:28:48] [INFO ] Invariant cache hit.
[2025-06-03 17:28:48] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:53] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:53] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:53] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:53] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:53] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:54] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:54] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:54] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:54] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:55] [INFO ] Deduced a trap composed of 128 places in 204 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:56] [INFO ] Deduced a trap composed of 133 places in 191 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:56] [INFO ] Deduced a trap composed of 116 places in 189 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:56] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:57] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:57] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:58] [INFO ] Deduced a trap composed of 116 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-03 17:29:01] [INFO ] Deduced a trap composed of 130 places in 187 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:01] [INFO ] Deduced a trap composed of 182 places in 225 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:01] [INFO ] Deduced a trap composed of 182 places in 193 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/334 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:18] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/1012 variables, and 58 constraints, problems are : Problem set: 66 solved, 622 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/334 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 622 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 14/14 constraints. Problems are: Problem set: 66 solved, 622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 22/36 constraints. Problems are: Problem set: 66 solved, 622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 19/55 constraints. Problems are: Problem set: 66 solved, 622 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/55 constraints. Problems are: Problem set: 66 solved, 622 unsolved
At refinement iteration 4 (OVERLAPS) 2/334 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 622 unsolved
SMT process timed out in 60366ms, After SMT, problems are : Problem set: 66 solved, 622 unsolved
Search for dead transitions found 66 dead transitions in 60368ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 334/470 places, 624/824 transitions.
Reduce places removed 1 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 321 transition count 600
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 12 rules in 11 ms. Remains 321 /334 variables (removed 13) and now considering 600/624 (removed 24) transitions.
[2025-06-03 17:29:49] [INFO ] Flow matrix only has 588 transitions (discarded 12 similar events)
// Phase 1: matrix 588 rows 321 cols
[2025-06-03 17:29:49] [INFO ] Computed 39 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:29:49] [INFO ] Implicit Places using invariants in 758 ms returned []
[2025-06-03 17:29:49] [INFO ] Flow matrix only has 588 transitions (discarded 12 similar events)
[2025-06-03 17:29:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:29:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:29:53] [INFO ] Implicit Places using invariants and state equation in 3675 ms returned []
Implicit Place search using SMT with State Equation took 4459 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 321/470 places, 600/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 111465 ms. Remains : 321/470 places, 600/824 transitions.
[2025-06-03 17:29:53] [INFO ] Found a total of 1 fixed domain variables (out of 321 variables) in GAL type petri
[2025-06-03 17:29:53] [INFO ] Found a total of 1 constant array cells/variables (out of 321 variables) in type petri
[2025-06-03 17:29:53] [INFO ] P_1097,
[2025-06-03 17:29:53] [INFO ] Removed 1 constant variables :P_1097=0
[2025-06-03 17:29:53] [INFO ] Simplified 1 expressions due to constant valuations.
[2025-06-03 17:29:53] [INFO ] Flatten gal took : 29 ms
[2025-06-03 17:29:53] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:29:53] [INFO ] Input system was already deterministic with 600 transitions.
Support contains 7 out of 320 places (down from 9) after GAL structural reductions.
[2025-06-03 17:29:53] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:29:53] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:29:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18379320546741047774.gal : 2 ms
[2025-06-03 17:29:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4560143158901501851.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/CTLFireability18379320546741047774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4560143158901501851.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-03 17:30:23] [INFO ] Flatten gal took : 32 ms
[2025-06-03 17:30:23] [INFO ] Applying decomposition
[2025-06-03 17:30:23] [INFO ] Flatten gal took : 16 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/graph11390454692130620203.txt' '-o' '/tmp/graph11390454692130620203.bin' '-w' '/tmp/graph11390454692130620203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11390454692130620203.bin' '-l' '-1' '-v' '-w' '/tmp/graph11390454692130620203.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:30:23] [INFO ] Decomposing Gal with order
[2025-06-03 17:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:30:23] [INFO ] Removed a total of 550 redundant transitions.
[2025-06-03 17:30:23] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 5 ms.
[2025-06-03 17:30:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7004814379897825471.gal : 3 ms
[2025-06-03 17:30:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6238477068816747568.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/CTLFireability7004814379897825471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6238477068816747568.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 28 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:30:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 17:30:53] [INFO ] Computed 38 invariants in 16 ms
[2025-06-03 17:30:53] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:00] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:01] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:01] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:01] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:01] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:01] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:02] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:02] [INFO ] Deduced a trap composed of 121 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-03 17:31:02] [INFO ] Deduced a trap composed of 210 places in 248 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:02] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:03] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:04] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:06] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:06] [INFO ] Deduced a trap composed of 298 places in 247 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:07] [INFO ] Deduced a trap composed of 222 places in 260 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:07] [INFO ] Deduced a trap composed of 227 places in 264 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:07] [INFO ] Deduced a trap composed of 210 places in 252 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:11] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:12] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40447ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40449ms
[2025-06-03 17:31:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:31:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:31:35] [INFO ] Implicit Places using invariants in 860 ms returned []
[2025-06-03 17:31:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:31:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:31:42] [INFO ] Implicit Places using invariants and state equation in 6906 ms returned []
Implicit Place search using SMT with State Equation took 7771 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:31:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:31:42] [INFO ] Invariant cache hit.
[2025-06-03 17:31:42] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:48] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:49] [INFO ] Deduced a trap composed of 64 places in 379 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:49] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:49] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:50] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:50] [INFO ] Deduced a trap composed of 121 places in 267 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:50] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:51] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:51] [INFO ] Deduced a trap composed of 210 places in 241 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:51] [INFO ] Deduced a trap composed of 217 places in 238 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:51] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:52] [INFO ] Deduced a trap composed of 222 places in 213 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:55] [INFO ] Deduced a trap composed of 210 places in 217 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:55] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:55] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:56] [INFO ] Deduced a trap composed of 227 places in 255 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:31:57] [INFO ] Deduced a trap composed of 287 places in 275 ms of which 85 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:32:12] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 53 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108667 ms. Remains : 456/470 places, 812/824 transitions.
[2025-06-03 17:32:42] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:32:42] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:32:42] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 17:32:42] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:32:42] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:32:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10204015114424371678.gal : 4 ms
[2025-06-03 17:32:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9191577054787486892.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/CTLFireability10204015114424371678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9191577054787486892.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-03 17:33:12] [INFO ] Flatten gal took : 31 ms
[2025-06-03 17:33:12] [INFO ] Applying decomposition
[2025-06-03 17:33:12] [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/graph17716281057371173315.txt' '-o' '/tmp/graph17716281057371173315.bin' '-w' '/tmp/graph17716281057371173315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17716281057371173315.bin' '-l' '-1' '-v' '-w' '/tmp/graph17716281057371173315.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:33:12] [INFO ] Decomposing Gal with order
[2025-06-03 17:33:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:33:12] [INFO ] Removed a total of 760 redundant transitions.
[2025-06-03 17:33:12] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:33:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 5 ms.
[2025-06-03 17:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17526142966893451070.gal : 5 ms
[2025-06-03 17:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10039349116498542143.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/CTLFireability17526142966893451070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10039349116498542143.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.
[2025-06-03 17:33:43] [INFO ] Flatten gal took : 24 ms
[2025-06-03 17:33:43] [INFO ] Flatten gal took : 30 ms
[2025-06-03 17:33:43] [INFO ] Applying decomposition
[2025-06-03 17:33:43] [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/graph17778410977419040985.txt' '-o' '/tmp/graph17778410977419040985.bin' '-w' '/tmp/graph17778410977419040985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17778410977419040985.bin' '-l' '-1' '-v' '-w' '/tmp/graph17778410977419040985.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:33:43] [INFO ] Decomposing Gal with order
[2025-06-03 17:33:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:33:43] [INFO ] Removed a total of 756 redundant transitions.
[2025-06-03 17:33:43] [INFO ] Flatten gal took : 58 ms
[2025-06-03 17:33:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 7 ms.
[2025-06-03 17:33:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15341099240674715448.gal : 6 ms
[2025-06-03 17:33:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6988917304815840563.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/CTLFireability15341099240674715448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6988917304815840563.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 15 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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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-174881254000410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 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 ;