About the Execution of ITS-Tools for MedleyA-PT-23
| 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 | ?FTFF?T?TF??F?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200274.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 MedleyA-PT-23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200274
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 150K 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 MedleyA-PT-23-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-23-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748899016588
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 21:16:59] [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-02 21:16:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:16:59] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2025-06-02 21:16:59] [INFO ] Transformed 378 places.
[2025-06-02 21:16:59] [INFO ] Transformed 614 transitions.
[2025-06-02 21:16:59] [INFO ] Found NUPN structural information;
[2025-06-02 21:16:59] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 117 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 79 place count 299 transition count 538
Iterating global reduction 1 with 76 rules applied. Total rules applied 155 place count 299 transition count 538
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 199 place count 255 transition count 494
Iterating global reduction 1 with 44 rules applied. Total rules applied 243 place count 255 transition count 494
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 251 place count 247 transition count 484
Iterating global reduction 1 with 8 rules applied. Total rules applied 259 place count 247 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 260 place count 246 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 261 place count 246 transition count 481
Applied a total of 261 rules in 207 ms. Remains 246 /378 variables (removed 132) and now considering 481/614 (removed 133) transitions.
// Phase 1: matrix 481 rows 246 cols
[2025-06-02 21:17:00] [INFO ] Computed 8 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:17:00] [INFO ] Implicit Places using invariants in 612 ms returned []
[2025-06-02 21:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:17:01] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2025-06-02 21:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:14] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 481/727 variables, 246/255 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:27] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 727/727 variables, and 256 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 481/727 variables, 246/256 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/727 variables, 480/736 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:49] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/727 variables, and 737 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60861ms
Starting structural reductions in LTL mode, iteration 1 : 246/378 places, 481/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62507 ms. Remains : 246/378 places, 481/614 transitions.
Support contains 117 out of 246 places after structural reductions.
[2025-06-02 21:18:02] [INFO ] Flatten gal took : 128 ms
[2025-06-02 21:18:02] [INFO ] Flatten gal took : 45 ms
[2025-06-02 21:18:03] [INFO ] Input system was already deterministic with 481 transitions.
Support contains 114 out of 246 places (down from 117) after GAL structural reductions.
RANDOM walk for 40000 steps (20 resets) in 2688 ms. (14 steps per ms) remains 41/90 properties
BEST_FIRST walk for 4004 steps (13 resets) in 30 ms. (129 steps per ms) remains 37/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 57 ms. (69 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4004 steps (10 resets) in 41 ms. (95 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4004 steps (17 resets) in 47 ms. (83 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (17 resets) in 31 ms. (125 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4001 steps (13 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 23/27 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
[2025-06-02 21:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 51/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 331/422 variables, 91/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 238/660 variables, 110/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 54/714 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/727 variables, 10/254 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/727 variables, 0/254 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/727 variables, 0/254 constraints. Problems are: Problem set: 5 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 727/727 variables, and 254 constraints, problems are : Problem set: 5 solved, 13 unsolved in 4574 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 50/72 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 5/77 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 312/389 variables, 77/85 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/86 constraints. Problems are: Problem set: 5 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:09] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/87 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/87 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 233/622 variables, 113/200 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 12/212 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 70/692 variables, 34/246 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 0/246 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 30/722 variables, 17/263 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 0/263 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 5/727 variables, 5/268 constraints. Problems are: Problem set: 5 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/727 variables, and 268 constraints, problems are : Problem set: 5 solved, 13 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 13/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9623ms problems are : Problem set: 5 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 481/481 transitions.
Graph (trivial) has 191 edges and 246 vertex of which 28 / 246 are part of one of the 3 SCC in 7 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 221 transition count 409
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 191 transition count 409
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 61 place count 191 transition count 405
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 187 transition count 405
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 107 place count 149 transition count 353
Iterating global reduction 2 with 38 rules applied. Total rules applied 145 place count 149 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 147 place count 149 transition count 351
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 147 place count 149 transition count 348
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 146 transition count 348
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 167 place count 132 transition count 306
Iterating global reduction 3 with 14 rules applied. Total rules applied 181 place count 132 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 189 place count 132 transition count 298
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 131 transition count 297
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 237 place count 108 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 240 place count 108 transition count 271
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 247 place count 101 transition count 250
Iterating global reduction 6 with 7 rules applied. Total rules applied 254 place count 101 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 256 place count 101 transition count 248
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 257 place count 100 transition count 246
Iterating global reduction 7 with 1 rules applied. Total rules applied 258 place count 100 transition count 246
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 259 place count 99 transition count 243
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 99 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 261 place count 99 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 263 place count 98 transition count 241
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 277 place count 91 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 284 place count 91 transition count 243
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 286 place count 89 transition count 237
Iterating global reduction 8 with 2 rules applied. Total rules applied 288 place count 89 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 290 place count 89 transition count 235
Free-agglomeration rule applied 20 times.
Iterating global reduction 9 with 20 rules applied. Total rules applied 310 place count 89 transition count 215
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 336 place count 69 transition count 209
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 338 place count 69 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 340 place count 67 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 341 place count 66 transition count 210
Applied a total of 341 rules in 233 ms. Remains 66 /246 variables (removed 180) and now considering 210/481 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 66/246 places, 210/481 transitions.
RANDOM walk for 40000 steps (35 resets) in 1356 ms. (29 steps per ms) remains 1/13 properties
BEST_FIRST walk for 866 steps (0 resets) in 7 ms. (108 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-02 21:18:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 21:18:14] [INFO ] Flatten gal took : 34 ms
FORMULA MedleyA-PT-23-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 21:18:14] [INFO ] Flatten gal took : 34 ms
[2025-06-02 21:18:14] [INFO ] Input system was already deterministic with 481 transitions.
Support contains 96 out of 246 places (down from 101) after GAL structural reductions.
Computed a total of 24 stabilizing places and 29 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 204 transition count 427
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 204 transition count 427
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 108 place count 180 transition count 389
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 180 transition count 389
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 143 place count 169 transition count 363
Iterating global reduction 0 with 11 rules applied. Total rules applied 154 place count 169 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 155 place count 169 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 161 place count 163 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 167 place count 163 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 170 place count 163 transition count 345
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 159 transition count 335
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 159 transition count 335
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 182 place count 159 transition count 331
Applied a total of 182 rules in 21 ms. Remains 159 /246 variables (removed 87) and now considering 331/481 (removed 150) transitions.
// Phase 1: matrix 331 rows 159 cols
[2025-06-02 21:18:14] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:18:14] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 21:18:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:18:15] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2025-06-02 21:18:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/490 variables, 159/167 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:29] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:40] [INFO ] Deduced a trap along path composed of 3 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-02 21:18:41] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:42] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 171 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:46] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/490 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 330/499 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:54] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:54] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:56] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:57] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 506 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 159/246 places, 331/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 159/246 places, 331/481 transitions.
[2025-06-02 21:19:15] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:19:15] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:19:15] [INFO ] Input system was already deterministic with 331 transitions.
[2025-06-02 21:19:15] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:19:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:19:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17526287271511792145.gal : 15 ms
[2025-06-02 21:19:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12652275854378536675.ctl : 7 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/CTLFireability17526287271511792145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12652275854378536675.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-02 21:19:45] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:19:45] [INFO ] Applying decomposition
[2025-06-02 21:19:45] [INFO ] Flatten gal took : 14 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/graph8892941056815642317.txt' '-o' '/tmp/graph8892941056815642317.bin' '-w' '/tmp/graph8892941056815642317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8892941056815642317.bin' '-l' '-1' '-v' '-w' '/tmp/graph8892941056815642317.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:19:45] [INFO ] Decomposing Gal with order
[2025-06-02 21:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:19:45] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-02 21:19:46] [INFO ] Flatten gal took : 90 ms
[2025-06-02 21:19:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 20 ms.
[2025-06-02 21:19:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16409073813242302232.gal : 9 ms
[2025-06-02 21:19:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5489263475477630099.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/CTLFireability16409073813242302232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5489263475477630099.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.
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,9.72692e+09,1.87149,45916,1143,64,73586,956,711,139958,94,2166,0
Converting to forward existential form...Done !
original formula: E(E(AF(EX(((i0.u4.p19==1)&&(i2.u16.p95==1)))) U !(EX(AF(((i5.i1.u38.p328==1)&&(i9.u48.p375==1)))))) U ((!((AX((i5.i0.u32.p272==1)) * (i4....409
=> equivalent forward existential formula: [FwdG(EY((((FwdU(Init,E(!(EG(!(EX(((i0.u4.p19==1)&&(i2.u16.p95==1)))))) U !(EX(!(EG(!(((i5.i1.u38.p328==1)&&(i9....501
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t146, t148, t149, t150, t183, t185, t186, t187, t208, t210, t211, t212, t217, t218,...940
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,2.97552,47836,1,0,76648,3321,4295,160001,494,9543,271224
FORMULA MedleyA-PT-23-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 211 transition count 436
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 211 transition count 436
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 92 place count 189 transition count 399
Iterating global reduction 0 with 22 rules applied. Total rules applied 114 place count 189 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 189 transition count 398
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 126 place count 178 transition count 374
Iterating global reduction 1 with 11 rules applied. Total rules applied 137 place count 178 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 178 transition count 373
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 175 transition count 365
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 175 transition count 365
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 146 place count 175 transition count 363
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 172 transition count 356
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 172 transition count 356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 155 place count 172 transition count 353
Applied a total of 155 rules in 22 ms. Remains 172 /246 variables (removed 74) and now considering 353/481 (removed 128) transitions.
// Phase 1: matrix 353 rows 172 cols
[2025-06-02 21:19:49] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:19:49] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 21:19:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:19:49] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2025-06-02 21:19:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (OVERLAPS) 353/525 variables, 172/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:03] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 181 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 353/525 variables, 172/181 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 352/533 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:29] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:45] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 535 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 172/246 places, 353/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 172/246 places, 353/481 transitions.
[2025-06-02 21:20:49] [INFO ] Flatten gal took : 29 ms
[2025-06-02 21:20:49] [INFO ] Flatten gal took : 55 ms
[2025-06-02 21:20:49] [INFO ] Input system was already deterministic with 353 transitions.
[2025-06-02 21:20:49] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:20:49] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:20:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8741574253254693359.gal : 5 ms
[2025-06-02 21:20:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17785639262352134679.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/CTLFireability8741574253254693359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17785639262352134679.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-02 21:21:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:21:20] [INFO ] Applying decomposition
[2025-06-02 21:21:20] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9543351430028529142.txt' '-o' '/tmp/graph9543351430028529142.bin' '-w' '/tmp/graph9543351430028529142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9543351430028529142.bin' '-l' '-1' '-v' '-w' '/tmp/graph9543351430028529142.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:21:20] [INFO ] Decomposing Gal with order
[2025-06-02 21:21:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:21:20] [INFO ] Removed a total of 504 redundant transitions.
[2025-06-02 21:21:20] [INFO ] Flatten gal took : 36 ms
[2025-06-02 21:21:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 11 ms.
[2025-06-02 21:21:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4388533602754330414.gal : 4 ms
[2025-06-02 21:21:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11943275933896512085.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/CTLFireability4388533602754330414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11943275933896512085.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63469e+10,3.71691,72820,1657,73,121613,1054,746,257262,99,3593,0
Converting to forward existential form...Done !
original formula: ((EF(EX((((i3.u17.p131==0)||(i5.i0.u30.p235==0)) * !(A((i5.i1.u31.p317==1) U (i5.i1.u39.p294==1)))))) * A(((AX(EG((i5.i1.u35.p250==1))) *...606
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX((((i3.u17.p131==0)||(i5.i0.u30.p235==0)) * !(!((E(!((i5.i1.u39.p294==1)) U (!((i5.i1.u3...1163
Reverse transition relation is NOT exact ! Due to transitions t19, t68, t159, t160, t162, t163, t171, t191, t198, t199, t201, t202, t217, t224, t225, t227,...932
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Graph (trivial) has 206 edges and 246 vertex of which 30 / 246 are part of one of the 3 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 218 transition count 410
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 187 transition count 410
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 63 place count 187 transition count 404
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 181 transition count 404
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 117 place count 139 transition count 346
Iterating global reduction 2 with 42 rules applied. Total rules applied 159 place count 139 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 162 place count 139 transition count 343
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 162 place count 139 transition count 339
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 170 place count 135 transition count 339
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 186 place count 119 transition count 291
Iterating global reduction 3 with 16 rules applied. Total rules applied 202 place count 119 transition count 291
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 209 place count 119 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 210 place count 118 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 118 transition count 282
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 212 place count 117 transition count 279
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 117 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 117 transition count 278
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 252 place count 98 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 98 transition count 258
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 262 place count 89 transition count 231
Iterating global reduction 6 with 9 rules applied. Total rules applied 271 place count 89 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 273 place count 89 transition count 229
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 274 place count 88 transition count 227
Iterating global reduction 7 with 1 rules applied. Total rules applied 275 place count 88 transition count 227
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 87 transition count 224
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 87 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 278 place count 87 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 280 place count 86 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 287 place count 86 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 83 transition count 212
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 296 place count 80 transition count 203
Iterating global reduction 8 with 3 rules applied. Total rules applied 299 place count 80 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 302 place count 80 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 304 place count 78 transition count 198
Applied a total of 304 rules in 114 ms. Remains 78 /246 variables (removed 168) and now considering 198/481 (removed 283) transitions.
[2025-06-02 21:21:50] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
// Phase 1: matrix 188 rows 78 cols
[2025-06-02 21:21:50] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:21:50] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 21:21:50] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
[2025-06-02 21:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:21:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:21:50] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:21:50] [INFO ] Redundant transitions in 9 ms returned []
Running 172 sub problems to find dead transitions.
[2025-06-02 21:21:50] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
[2025-06-02 21:21:50] [INFO ] Invariant cache hit.
[2025-06-02 21:21:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 187/262 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 3/265 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:59] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:22:04] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/265 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 89 constraints, problems are : Problem set: 0 solved, 172 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 187/262 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 3/265 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 151/261 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 261 constraints, problems are : Problem set: 0 solved, 172 unsolved in 15699 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35818ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 35819ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/246 places, 198/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36271 ms. Remains : 78/246 places, 198/481 transitions.
[2025-06-02 21:22:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:22:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:22:26] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 21:22:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:22:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 21:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14409785667530980571.gal : 3 ms
[2025-06-02 21:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1224143519542669957.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/CTLFireability14409785667530980571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1224143519542669957.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10353e+07,8.05805,165176,2,7982,5,403153,6,0,506,598381,0
Converting to forward existential form...Done !
original formula: AF((EF(((p183==1)&&(p371==1))) * (p301!=1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((p183==1)&&(p371==1))) * (p301!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t9, t14, t15, t18, t22, t29, t30, t33, t36, t37, t44, t45, t56, t59, t70, t80, t8...488
Detected timeout of ITS tools.
[2025-06-02 21:22:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:22:56] [INFO ] Applying decomposition
[2025-06-02 21:22:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5320586443910911531.txt' '-o' '/tmp/graph5320586443910911531.bin' '-w' '/tmp/graph5320586443910911531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5320586443910911531.bin' '-l' '-1' '-v' '-w' '/tmp/graph5320586443910911531.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:22:56] [INFO ] Decomposing Gal with order
[2025-06-02 21:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:22:56] [INFO ] Removed a total of 320 redundant transitions.
[2025-06-02 21:22:56] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 6 ms.
[2025-06-02 21:22:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9779214327696648894.gal : 2 ms
[2025-06-02 21:22:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16844997455246880389.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/CTLFireability9779214327696648894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16844997455246880389.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10353e+07,0.1548,7980,249,109,7100,553,376,13261,101,2567,0
Converting to forward existential form...Done !
original formula: AF((EF(((i3.u9.p183==1)&&(i8.u18.p371==1))) * (i5.u13.p301!=1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i3.u9.p183==1)&&(i8.u18.p371==1))) * (i5.u13.p301!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t59, t70, t83, t84, t85, t95, t96, t97, t116, t117, t118, t142, t144, t146, t171, t173, ...475
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,11.4375,261124,1,0,336690,16165,2014,1.29139e+06,498,136653,709419
FORMULA MedleyA-PT-23-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 205 transition count 428
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 205 transition count 428
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 107 place count 180 transition count 391
Iterating global reduction 0 with 25 rules applied. Total rules applied 132 place count 180 transition count 391
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 145 place count 167 transition count 362
Iterating global reduction 0 with 13 rules applied. Total rules applied 158 place count 167 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 159 place count 167 transition count 361
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 165 place count 161 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 171 place count 161 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 174 place count 161 transition count 343
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 179 place count 156 transition count 331
Iterating global reduction 2 with 5 rules applied. Total rules applied 184 place count 156 transition count 331
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 189 place count 156 transition count 326
Applied a total of 189 rules in 18 ms. Remains 156 /246 variables (removed 90) and now considering 326/481 (removed 155) transitions.
// Phase 1: matrix 326 rows 156 cols
[2025-06-02 21:23:08] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:08] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 21:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:08] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-02 21:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/482 variables, 156/164 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:21] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:32] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:33] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:34] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 1.0)
(t14 1.0)
(t15 1.0)
(t16 0.0)
(t17 0.0)
(t18 1.0)
(t19 1.0)
(t20 2.0)
(t21 1.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 1.0)
(t50 1.0)
(t51 0.0)
(t52 2.0)
(t53 2.0)
(t54 1.0)
(t55 1.0)
(t56 1.0)
(t57 0.0)
(t58 1.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 1.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 2.0)
(t85 2.0)
(t86 1.0)
(t87 1.0)
(t88 1.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 1.0)
(t122 0.0)
(t123 0.0)
(t124 1.0)
(t125 1.0)
(t126 1.0)
(t127 1.0)
(t128 1.0)
(t129 0.0)
(t130 1.0)
(t131 0.0)
(t132 0.0)
(t133 1.0)
(t134 0.0)
(t135 1.0)
(t136 0.0)
(t137 0.0)
(t138 1.0)
(t139 1.0)
(t140 0.0)
(t141 1.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 1.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 1.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 1.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 1.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 1.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)timeout
(t305 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 168 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/482 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 325/490 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:45] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:53] [INFO ] Deduced a trap composed of 45 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-02 21:23:53] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:53] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:24:03] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:24:03] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 496 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 156/246 places, 326/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 156/246 places, 326/481 transitions.
[2025-06-02 21:24:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:24:09] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:24:09] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-02 21:24:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:24:09] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:24:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17793677592459863635.gal : 4 ms
[2025-06-02 21:24:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17964243081928656762.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/CTLFireability17793677592459863635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17964243081928656762.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-02 21:24:39] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:24:39] [INFO ] Applying decomposition
[2025-06-02 21:24:39] [INFO ] Flatten gal took : 13 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/graph240581832455269827.txt' '-o' '/tmp/graph240581832455269827.bin' '-w' '/tmp/graph240581832455269827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph240581832455269827.bin' '-l' '-1' '-v' '-w' '/tmp/graph240581832455269827.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:24:39] [INFO ] Decomposing Gal with order
[2025-06-02 21:24:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:24:39] [INFO ] Removed a total of 469 redundant transitions.
[2025-06-02 21:24:39] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:24:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 8 ms.
[2025-06-02 21:24:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14121489434469315092.gal : 3 ms
[2025-06-02 21:24:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12558685597224676362.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/CTLFireability14121489434469315092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12558685597224676362.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06221e+10,4.9477,104360,1682,57,176877,649,709,373719,83,1761,0
Converting to forward existential form...Done !
original formula: EF((AX(A(EF((i1.i0.u10.p82==1)) U ((((i6.u30.p305==1)&&(i7.u39.p338==1))||(i6.u31.p259==1)) * AG((((i4.u2.p12==1)&&(u5.p25==1))&&(i1.i2.u...357
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EX(!(!((E(!(((((i6.u30.p305==1)&&(i7.u39.p338==1))||(i6.u31.p259==1)) * !(E(TRUE U !(((...1718
Reverse transition relation is NOT exact ! Due to transitions t19, t54, t144, t146, t147, t182, t184, t185, t207, t209, t210, t218, t219, t220, t221, t222,...860
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Graph (trivial) has 204 edges and 246 vertex of which 30 / 246 are part of one of the 3 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 218 transition count 410
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 187 transition count 410
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 63 place count 187 transition count 406
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 183 transition count 406
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 114 place count 140 transition count 345
Iterating global reduction 2 with 43 rules applied. Total rules applied 157 place count 140 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 160 place count 140 transition count 342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 160 place count 140 transition count 338
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 168 place count 136 transition count 338
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 183 place count 121 transition count 293
Iterating global reduction 3 with 15 rules applied. Total rules applied 198 place count 121 transition count 293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 121 transition count 287
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 205 place count 120 transition count 285
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 120 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 207 place count 119 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 119 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 119 transition count 281
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 247 place count 100 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 248 place count 100 transition count 261
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 257 place count 91 transition count 234
Iterating global reduction 6 with 9 rules applied. Total rules applied 266 place count 91 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 268 place count 91 transition count 232
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 270 place count 89 transition count 228
Iterating global reduction 7 with 2 rules applied. Total rules applied 272 place count 89 transition count 228
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 274 place count 87 transition count 222
Iterating global reduction 7 with 2 rules applied. Total rules applied 276 place count 87 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 278 place count 87 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 280 place count 86 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 286 place count 86 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 292 place count 83 transition count 210
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 295 place count 80 transition count 201
Iterating global reduction 8 with 3 rules applied. Total rules applied 298 place count 80 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 301 place count 80 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 303 place count 78 transition count 196
Applied a total of 303 rules in 88 ms. Remains 78 /246 variables (removed 168) and now considering 196/481 (removed 285) transitions.
[2025-06-02 21:25:09] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
// Phase 1: matrix 187 rows 78 cols
[2025-06-02 21:25:09] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 21:25:09] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
[2025-06-02 21:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 21:25:09] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:25:09] [INFO ] Redundant transitions in 14 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-02 21:25:09] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
[2025-06-02 21:25:09] [INFO ] Invariant cache hit.
[2025-06-02 21:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 186/261 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:15] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 3/264 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 89 constraints, problems are : Problem set: 0 solved, 170 unsolved in 17168 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 186/261 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 3/264 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 149/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 0/264 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 259 constraints, problems are : Problem set: 0 solved, 170 unsolved in 19282 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36522ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 36523ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/246 places, 196/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36908 ms. Remains : 78/246 places, 196/481 transitions.
[2025-06-02 21:25:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:25:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:25:46] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-02 21:25:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:25:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 21:25:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9724016113388456047.gal : 4 ms
[2025-06-02 21:25:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6679787417999010512.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/CTLFireability9724016113388456047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6679787417999010512.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,2.20536e+07,3.38889,76796,2,8042,5,251816,6,0,504,295005,0
Converting to forward existential form...Done !
original formula: AF(EG(EF((((p12==1)&&(p25==1))&&(p140==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (((p12==1)&&(p25==1))&&(p140==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t13, t16, t19, t20, t27, t28, t32, t35, t36, t43, t44, t79, t80, t81, t82, t...474
Detected timeout of ITS tools.
[2025-06-02 21:26:16] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:26:16] [INFO ] Applying decomposition
[2025-06-02 21:26:16] [INFO ] Flatten gal took : 10 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/graph5874284833435304540.txt' '-o' '/tmp/graph5874284833435304540.bin' '-w' '/tmp/graph5874284833435304540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5874284833435304540.bin' '-l' '-1' '-v' '-w' '/tmp/graph5874284833435304540.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:26:16] [INFO ] Decomposing Gal with order
[2025-06-02 21:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:26:16] [INFO ] Removed a total of 312 redundant transitions.
[2025-06-02 21:26:16] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2025-06-02 21:26:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12185800995167592574.gal : 2 ms
[2025-06-02 21:26:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4576215366657611581.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/CTLFireability12185800995167592574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4576215366657611581.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.
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,2.20536e+07,0.161836,7976,250,77,7179,360,359,13462,94,1110,0
Converting to forward existential form...Done !
original formula: AF(EG(EF((((u0.p12==1)&&(u2.p25==1))&&(i5.u10.p140==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (((u0.p12==1)&&(u2.p25==1))&&(i5.u10.p140==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t79, t80, t81, t94, t95, t96, t112, t113, t114, t136, t139, t141, t167, t168, t169, t171, t17...457
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,4.35032,115880,1,0,165825,12651,1996,504015,451,85934,329989
FORMULA MedleyA-PT-23-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Graph (trivial) has 203 edges and 246 vertex of which 30 / 246 are part of one of the 3 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 218 transition count 412
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 189 transition count 412
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 59 place count 189 transition count 406
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 71 place count 183 transition count 406
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 111 place count 143 transition count 348
Iterating global reduction 2 with 40 rules applied. Total rules applied 151 place count 143 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 143 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 154 place count 143 transition count 342
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 140 transition count 342
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 175 place count 125 transition count 297
Iterating global reduction 3 with 15 rules applied. Total rules applied 190 place count 125 transition count 297
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 196 place count 125 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 124 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 124 transition count 289
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 123 transition count 286
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 123 transition count 285
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 241 place count 103 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 103 transition count 264
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 251 place count 94 transition count 237
Iterating global reduction 6 with 9 rules applied. Total rules applied 260 place count 94 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 262 place count 94 transition count 235
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 264 place count 92 transition count 231
Iterating global reduction 7 with 2 rules applied. Total rules applied 266 place count 92 transition count 231
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 268 place count 90 transition count 225
Iterating global reduction 7 with 2 rules applied. Total rules applied 270 place count 90 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 272 place count 90 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 274 place count 89 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 280 place count 89 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 286 place count 86 transition count 213
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 289 place count 83 transition count 204
Iterating global reduction 8 with 3 rules applied. Total rules applied 292 place count 83 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 295 place count 83 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 297 place count 81 transition count 199
Applied a total of 297 rules in 81 ms. Remains 81 /246 variables (removed 165) and now considering 199/481 (removed 282) transitions.
[2025-06-02 21:26:20] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
// Phase 1: matrix 190 rows 81 cols
[2025-06-02 21:26:20] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:26:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 21:26:21] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2025-06-02 21:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:26:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:26:21] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:26:21] [INFO ] Redundant transitions in 3 ms returned []
Running 173 sub problems to find dead transitions.
[2025-06-02 21:26:21] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2025-06-02 21:26:21] [INFO ] Invariant cache hit.
[2025-06-02 21:26:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 189/267 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:26:25] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:26:28] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 3/270 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/271 variables, and 92 constraints, problems are : Problem set: 0 solved, 173 unsolved in 17785 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 189/267 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 25/112 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 3/270 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 148/265 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:26:47] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/271 variables, and 266 constraints, problems are : Problem set: 0 solved, 173 unsolved in 21456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39282ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 39283ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/246 places, 199/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39658 ms. Remains : 81/246 places, 199/481 transitions.
[2025-06-02 21:27:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:27:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:27:00] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-02 21:27:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:27:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:27:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9161829875351632824.gal : 1 ms
[2025-06-02 21:27:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9115795963117664131.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/CTLFireability9161829875351632824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9115795963117664131.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,1.4635e+07,6.29681,134116,2,8576,5,340946,6,0,519,486134,0
Converting to forward existential form...Done !
original formula: AF(!(E(!(AF((p110==1))) U ((p367==1) + AG((p252==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(!(EG(!((p110==1))))) U ((p367==1) + !(E(TRUE U !((p252==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t13, t14, t17, t20, t23, t24, t31, t32, t35, t38, t39, t42, t48, t49, t82, t83, t...484
Detected timeout of ITS tools.
[2025-06-02 21:27:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:27:30] [INFO ] Applying decomposition
[2025-06-02 21:27:30] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8525777321482045191.txt' '-o' '/tmp/graph8525777321482045191.bin' '-w' '/tmp/graph8525777321482045191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8525777321482045191.bin' '-l' '-1' '-v' '-w' '/tmp/graph8525777321482045191.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:27:30] [INFO ] Decomposing Gal with order
[2025-06-02 21:27:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:27:30] [INFO ] Removed a total of 317 redundant transitions.
[2025-06-02 21:27:30] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:27:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 7 ms.
[2025-06-02 21:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9071974003758906040.gal : 3 ms
[2025-06-02 21:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6985251324451569811.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/CTLFireability9071974003758906040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6985251324451569811.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4635e+07,0.254612,8416,306,139,7581,1267,411,13819,114,4127,0
Converting to forward existential form...Done !
original formula: AF(!(E(!(AF((i1.u6.p110==1))) U ((i8.u19.p367==1) + AG((i5.u12.p252==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(!(EG(!((i1.u6.p110==1))))) U ((i8.u19.p367==1) + !(E(TRUE U !((i5.u12.p252==1)))))))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t85, t86, t87, t97, t98, t99, t112, t113, t114, t137, t139, t140, t170, t171, t172, t173, t17...517
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,21.3247,499384,1,0,782094,15283,2375,1.99197e+06,561,106941,1217205
FORMULA MedleyA-PT-23-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 208 transition count 431
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 208 transition count 431
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 99 place count 185 transition count 399
Iterating global reduction 0 with 23 rules applied. Total rules applied 122 place count 185 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 185 transition count 398
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 134 place count 174 transition count 373
Iterating global reduction 1 with 11 rules applied. Total rules applied 145 place count 174 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 146 place count 174 transition count 372
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 168 transition count 357
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 168 transition count 357
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 162 place count 168 transition count 353
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 165 transition count 346
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 165 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 165 transition count 343
Applied a total of 171 rules in 37 ms. Remains 165 /246 variables (removed 81) and now considering 343/481 (removed 138) transitions.
// Phase 1: matrix 343 rows 165 cols
[2025-06-02 21:27:52] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:52] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-02 21:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:52] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2025-06-02 21:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 343/508 variables, 165/173 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:02] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:07] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:08] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:08] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 177 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (OVERLAPS) 343/508 variables, 165/174 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 342/516 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:50] [INFO ] Deduced a trap along path composed of 9 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:50] [INFO ] Deduced a trap along path composed of 9 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-02 21:28:50] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 522 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 165/246 places, 343/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 165/246 places, 343/481 transitions.
[2025-06-02 21:28:52] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:28:52] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:28:52] [INFO ] Input system was already deterministic with 343 transitions.
[2025-06-02 21:28:53] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:28:53] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:28:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10180898243188838546.gal : 3 ms
[2025-06-02 21:28:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9174905854357293241.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/CTLFireability10180898243188838546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9174905854357293241.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-02 21:29:23] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:29:23] [INFO ] Applying decomposition
[2025-06-02 21:29:23] [INFO ] Flatten gal took : 14 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/graph11783304221619509763.txt' '-o' '/tmp/graph11783304221619509763.bin' '-w' '/tmp/graph11783304221619509763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11783304221619509763.bin' '-l' '-1' '-v' '-w' '/tmp/graph11783304221619509763.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:29:23] [INFO ] Decomposing Gal with order
[2025-06-02 21:29:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:29:23] [INFO ] Removed a total of 506 redundant transitions.
[2025-06-02 21:29:23] [INFO ] Flatten gal took : 39 ms
[2025-06-02 21:29:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2025-06-02 21:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11273726036479704700.gal : 6 ms
[2025-06-02 21:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1319177290992540598.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/CTLFireability11273726036479704700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1319177290992540598.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1566e+10,9.76905,177852,2200,84,285992,1490,726,560451,86,7590,0
Converting to forward existential form...Done !
original formula: EF((AG(EF((((((i6.u34.p273==1)&&(i1.u1.p12==1))&&((i7.u5.p30==1)&&(i2.i1.u11.p93==1)))||(i6.u37.p265==1))||(i3.u20.p148==1)))) * ((((i6.u...480
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (((((i6.u34.p273==1)&&(i1.u1.p12==1))&&((i7.u5.p30==1)&&(i2.i1.u11....1524
Reverse transition relation is NOT exact ! Due to transitions t53, t84, t149, t151, t152, t160, t162, t181, t183, t189, t191, t192, t207, t209, t215, t217,...978
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 204 transition count 429
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 204 transition count 429
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 111 place count 177 transition count 387
Iterating global reduction 0 with 27 rules applied. Total rules applied 138 place count 177 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 139 place count 177 transition count 386
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 150 place count 166 transition count 361
Iterating global reduction 1 with 11 rules applied. Total rules applied 161 place count 166 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 162 place count 166 transition count 360
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 169 place count 159 transition count 343
Iterating global reduction 2 with 7 rules applied. Total rules applied 176 place count 159 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 180 place count 159 transition count 339
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 185 place count 154 transition count 327
Iterating global reduction 3 with 5 rules applied. Total rules applied 190 place count 154 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 154 transition count 322
Applied a total of 195 rules in 15 ms. Remains 154 /246 variables (removed 92) and now considering 322/481 (removed 159) transitions.
// Phase 1: matrix 322 rows 154 cols
[2025-06-02 21:29:53] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:29:53] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 21:29:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:29:53] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-02 21:29:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 322/476 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:02] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:09] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:10] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:11] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 166 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/476 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 321/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:28] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:28] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:28] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:29] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:36] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:37] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 321 unsolved
SMT process timed out in 60084ms, After SMT, problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 154/246 places, 322/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 154/246 places, 322/481 transitions.
[2025-06-02 21:30:53] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:30:53] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:30:53] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-02 21:30:53] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:30:53] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:30:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13486140882010570265.gal : 4 ms
[2025-06-02 21:30:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5769374520357939148.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/CTLFireability13486140882010570265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5769374520357939148.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-02 21:31:23] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:31:23] [INFO ] Applying decomposition
[2025-06-02 21:31:23] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9020665409898768424.txt' '-o' '/tmp/graph9020665409898768424.bin' '-w' '/tmp/graph9020665409898768424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9020665409898768424.bin' '-l' '-1' '-v' '-w' '/tmp/graph9020665409898768424.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:31:24] [INFO ] Decomposing Gal with order
[2025-06-02 21:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:31:24] [INFO ] Removed a total of 473 redundant transitions.
[2025-06-02 21:31:24] [INFO ] Flatten gal took : 29 ms
[2025-06-02 21:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-02 21:31:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17018659524767084381.gal : 6 ms
[2025-06-02 21:31:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14820552568231493553.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/CTLFireability17018659524767084381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14820552568231493553.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.
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,9.80269e+09,15.2708,258252,2155,72,429341,908,638,840740,84,2621,0
Converting to forward existential form...Done !
original formula: E(!(E(!(((AF((i3.u15.p94==1)) + (((i0.u2.p12==1)&&(i5.u5.p25==1))&&(i6.u36.p315==1))) + ((i2.u17.p128==1)&&(i7.u41.p347==1)))) U AX(((((i...362
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(!(((!(EG(!((i3.u15.p94==1)))) + (((i0.u2.p12==1)&&(i5.u5.p25==1))&&(i6.u36.p315==1))) + ((i...427
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t137, t138, t140, t141, t149, t169, t176, t177, t179, t180, t195, t202, t203, t205,...1146
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Graph (trivial) has 184 edges and 246 vertex of which 18 / 246 are part of one of the 2 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 229 transition count 426
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 199 transition count 426
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 61 place count 199 transition count 418
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 77 place count 191 transition count 418
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 118 place count 150 transition count 363
Iterating global reduction 2 with 41 rules applied. Total rules applied 159 place count 150 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 150 transition count 362
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 160 place count 150 transition count 359
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 166 place count 147 transition count 359
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 182 place count 131 transition count 311
Iterating global reduction 3 with 16 rules applied. Total rules applied 198 place count 131 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 203 place count 131 transition count 306
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 204 place count 130 transition count 304
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 130 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 129 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 129 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 129 transition count 300
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 250 place count 108 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 252 place count 108 transition count 277
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 263 place count 97 transition count 245
Iterating global reduction 6 with 11 rules applied. Total rules applied 274 place count 97 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 277 place count 97 transition count 242
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 281 place count 93 transition count 234
Iterating global reduction 7 with 4 rules applied. Total rules applied 285 place count 93 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 287 place count 93 transition count 232
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 289 place count 91 transition count 226
Iterating global reduction 8 with 2 rules applied. Total rules applied 291 place count 91 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 293 place count 91 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 297 place count 89 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 301 place count 89 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 305 place count 87 transition count 216
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 307 place count 85 transition count 210
Iterating global reduction 9 with 2 rules applied. Total rules applied 309 place count 85 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 311 place count 85 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 313 place count 83 transition count 206
Applied a total of 313 rules in 55 ms. Remains 83 /246 variables (removed 163) and now considering 206/481 (removed 275) transitions.
[2025-06-02 21:31:54] [INFO ] Flow matrix only has 199 transitions (discarded 7 similar events)
// Phase 1: matrix 199 rows 83 cols
[2025-06-02 21:31:54] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:31:54] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 21:31:54] [INFO ] Flow matrix only has 199 transitions (discarded 7 similar events)
[2025-06-02 21:31:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:31:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 21:31:54] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:31:54] [INFO ] Redundant transitions in 2 ms returned []
Running 187 sub problems to find dead transitions.
[2025-06-02 21:31:54] [INFO ] Flow matrix only has 199 transitions (discarded 7 similar events)
[2025-06-02 21:31:54] [INFO ] Invariant cache hit.
[2025-06-02 21:31:54] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 198/278 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 3/281 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:32:03] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:32:06] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:32:09] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/282 variables, and 96 constraints, problems are : Problem set: 0 solved, 187 unsolved in 23331 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 198/278 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 3/281 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 156/283 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/282 variables, and 283 constraints, problems are : Problem set: 0 solved, 187 unsolved in 27211 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 50580ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 50580ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/246 places, 206/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50987 ms. Remains : 83/246 places, 206/481 transitions.
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:45] [INFO ] Input system was already deterministic with 206 transitions.
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15648790570944598429.gal : 2 ms
[2025-06-02 21:32:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13644809325991856420.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/CTLFireability15648790570944598429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13644809325991856420.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.27224e+07,2.43643,55996,2,6211,5,192560,6,0,535,223141,0
Converting to forward existential form...Done !
original formula: AF(AG(((AF((p331==0)) + (p354==1)) + (((p12==1)&&(p20==1))&&(p58==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EG(!((p331==0)))) + (p354==1)) + (((p12==1)&&(p20==1))&&(p58==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t15, t16, t19, t23, t26, t27, t34, t35, t38, t41, t42, t49, t50, t83, t84, t85, t...480
Detected timeout of ITS tools.
[2025-06-02 21:33:15] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:33:15] [INFO ] Applying decomposition
[2025-06-02 21:33:15] [INFO ] Flatten gal took : 10 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/graph4645940473722217839.txt' '-o' '/tmp/graph4645940473722217839.bin' '-w' '/tmp/graph4645940473722217839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4645940473722217839.bin' '-l' '-1' '-v' '-w' '/tmp/graph4645940473722217839.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:33:15] [INFO ] Decomposing Gal with order
[2025-06-02 21:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:33:15] [INFO ] Removed a total of 327 redundant transitions.
[2025-06-02 21:33:15] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 2 ms.
[2025-06-02 21:33:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14795822712097314807.gal : 3 ms
[2025-06-02 21:33:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2356614864646284840.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/CTLFireability14795822712097314807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2356614864646284840.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.27224e+07,0.124493,7096,231,161,5124,853,391,9585,110,5049,0
Converting to forward existential form...Done !
original formula: AF(AG(((AF((i6.u13.p331==0)) + (i8.u16.p354==1)) + (((u0.p12==1)&&(u1.p20==1))&&(i4.u4.p58==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EG(!((i6.u13.p331==0)))) + (i8.u16.p354==1)) + (((u0.p12==1)&&(u1.p20==1))&&(i4.u4...179
Reverse transition relation is NOT exact ! Due to transitions t86, t87, t88, t95, t96, t97, t116, t117, t118, t139, t140, t142, t173, t176, t179, t184, t18...472
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,11.6595,235964,1,0,334810,25475,2197,919252,577,243298,622590
FORMULA MedleyA-PT-23-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 208 transition count 435
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 208 transition count 435
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 99 place count 185 transition count 398
Iterating global reduction 0 with 23 rules applied. Total rules applied 122 place count 185 transition count 398
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 134 place count 173 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 146 place count 173 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 147 place count 173 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 153 place count 167 transition count 355
Iterating global reduction 1 with 6 rules applied. Total rules applied 159 place count 167 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 163 place count 167 transition count 351
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 164 transition count 344
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 164 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 172 place count 164 transition count 341
Applied a total of 172 rules in 12 ms. Remains 164 /246 variables (removed 82) and now considering 341/481 (removed 140) transitions.
// Phase 1: matrix 341 rows 164 cols
[2025-06-02 21:33:27] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:33:27] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 21:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:33:27] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2025-06-02 21:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 341/505 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:33:41] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 173 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 341/505 variables, 164/173 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 340/513 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:15] [INFO ] Deduced a trap along path composed of 3 places in 100 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:15] [INFO ] Deduced a trap along path composed of 9 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:15] [INFO ] Deduced a trap along path composed of 9 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:15] [INFO ] Deduced a trap along path composed of 9 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:15] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:15] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 519 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 164/246 places, 341/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 164/246 places, 341/481 transitions.
[2025-06-02 21:34:27] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:34:27] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:34:27] [INFO ] Input system was already deterministic with 341 transitions.
[2025-06-02 21:34:27] [INFO ] Flatten gal took : 9 ms
[2025-06-02 21:34:27] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:34:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13348583658721237574.gal : 2 ms
[2025-06-02 21:34:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4735292351447317819.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/CTLFireability13348583658721237574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4735292351447317819.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-02 21:34:57] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:34:57] [INFO ] Applying decomposition
[2025-06-02 21:34:57] [INFO ] Flatten gal took : 8 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/graph7067513336937176361.txt' '-o' '/tmp/graph7067513336937176361.bin' '-w' '/tmp/graph7067513336937176361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7067513336937176361.bin' '-l' '-1' '-v' '-w' '/tmp/graph7067513336937176361.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:34:57] [INFO ] Decomposing Gal with order
[2025-06-02 21:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:34:57] [INFO ] Removed a total of 500 redundant transitions.
[2025-06-02 21:34:57] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2025-06-02 21:34:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13903015068077762516.gal : 4 ms
[2025-06-02 21:34:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9361862130878893358.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/CTLFireability13903015068077762516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9361862130878893358.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1198e+10,2.7588,54688,1439,57,88880,588,735,179385,79,1652,0
Converting to forward existential form...Done !
original formula: (A(EG((((i1.u1.p12==1)&&(u5.p30==1))&&(i2.u8.p40==1))) U ((i8.i2.u30.p275==1) + A(((EF((i2.u10.p51==1)) + (i8.i2.u30.p260==1)) + (i8.i2.u...326
=> equivalent forward existential formula: ([((Init * !(EG(!(((i8.i2.u30.p275==1) + !((E(!(E(E(TRUE U (i2.u9.p43==1)) U EX(((i4.i0.u22.p187==1)&&(i7.u47.p3...1313
Reverse transition relation is NOT exact ! Due to transitions t19, t58, t150, t151, t153, t154, t155, t188, t189, t191, t192, t193, t214, t215, t217, t218,...959
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 203 transition count 426
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 203 transition count 426
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 113 place count 176 transition count 382
Iterating global reduction 0 with 27 rules applied. Total rules applied 140 place count 176 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 176 transition count 381
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 155 place count 162 transition count 350
Iterating global reduction 1 with 14 rules applied. Total rules applied 169 place count 162 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 170 place count 162 transition count 349
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 154 transition count 329
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 154 transition count 329
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 191 place count 154 transition count 324
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 196 place count 149 transition count 312
Iterating global reduction 3 with 5 rules applied. Total rules applied 201 place count 149 transition count 312
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 206 place count 149 transition count 307
Applied a total of 206 rules in 9 ms. Remains 149 /246 variables (removed 97) and now considering 307/481 (removed 174) transitions.
// Phase 1: matrix 307 rows 149 cols
[2025-06-02 21:35:28] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:35:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 21:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:35:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-02 21:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/456 variables, 149/157 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:35:36] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:35:41] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:35:42] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:35:43] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 161 constraints, problems are : Problem set: 0 solved, 306 unsolved in 23929 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/456 variables, 149/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 306/464 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:35:56] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:35:56] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:36:03] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 470 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 54010ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 54012ms
Starting structural reductions in LTL mode, iteration 1 : 149/246 places, 307/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54409 ms. Remains : 149/246 places, 307/481 transitions.
[2025-06-02 21:36:22] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:36:22] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:36:22] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 21:36:22] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:36:22] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:36:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13941889013680193916.gal : 2 ms
[2025-06-02 21:36:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2868802549535476516.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/CTLFireability13941889013680193916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2868802549535476516.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-02 21:36:52] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:36:52] [INFO ] Applying decomposition
[2025-06-02 21:36:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14057929770613433892.txt' '-o' '/tmp/graph14057929770613433892.bin' '-w' '/tmp/graph14057929770613433892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14057929770613433892.bin' '-l' '-1' '-v' '-w' '/tmp/graph14057929770613433892.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:36:52] [INFO ] Decomposing Gal with order
[2025-06-02 21:36:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:36:52] [INFO ] Removed a total of 441 redundant transitions.
[2025-06-02 21:36:52] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:36:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2025-06-02 21:36:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7541147695230104523.gal : 4 ms
[2025-06-02 21:36:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11201998629727954684.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/CTLFireability7541147695230104523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11201998629727954684.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.
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,7.2556e+09,3.07981,69428,1331,45,113594,661,632,256741,71,1866,0
Converting to forward existential form...Done !
original formula: (AG(AF(((i0.u2.p14==0)||(i3.i1.u24.p212==0)))) + (E((AG((i3.i0.u20.p160==1)) + ((EG((((i2.u16.p128==1)&&(i9.u46.p375==1))||(i4.u31.p275==...242
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(!(EG(!(((i0.u2.p14==0)||(i3.i1.u24.p212==0)))))))))) * !(E((!(E(TRUE U !((i3.i0.u20.p1...415
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t134, t136, t137, t170, t172, t173, t194, t196, t197, t202, t203, t204, t205, t206,...833
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,4.12593,69684,1,0,113594,1417,3720,256741,366,3594,268622
FORMULA MedleyA-PT-23-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 203 transition count 426
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 203 transition count 426
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 112 place count 177 transition count 385
Iterating global reduction 0 with 26 rules applied. Total rules applied 138 place count 177 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 139 place count 177 transition count 384
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 153 place count 163 transition count 353
Iterating global reduction 1 with 14 rules applied. Total rules applied 167 place count 163 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 163 transition count 352
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 175 place count 156 transition count 334
Iterating global reduction 2 with 7 rules applied. Total rules applied 182 place count 156 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 186 place count 156 transition count 330
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 191 place count 151 transition count 318
Iterating global reduction 3 with 5 rules applied. Total rules applied 196 place count 151 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 201 place count 151 transition count 313
Applied a total of 201 rules in 17 ms. Remains 151 /246 variables (removed 95) and now considering 313/481 (removed 168) transitions.
// Phase 1: matrix 313 rows 151 cols
[2025-06-02 21:36:56] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:36:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 21:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:36:57] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2025-06-02 21:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 313/464 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:07] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:15] [INFO ] Deduced a trap along path composed of 3 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-02 21:37:15] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:16] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 163 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/464 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 312/472 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:31] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:31] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:55] [INFO ] Deduced a trap along path composed of 9 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:55] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:37:55] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 480 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 151/246 places, 313/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60474 ms. Remains : 151/246 places, 313/481 transitions.
[2025-06-02 21:37:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:37:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:37:57] [INFO ] Input system was already deterministic with 313 transitions.
[2025-06-02 21:37:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:37:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:37:57] [INFO ] Time to serialize gal into /tmp/CTLFireability249452502532661198.gal : 2 ms
[2025-06-02 21:37:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10339088859609518585.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/CTLFireability249452502532661198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10339088859609518585.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-02 21:38:27] [INFO ] Flatten gal took : 10 ms
[2025-06-02 21:38:27] [INFO ] Applying decomposition
[2025-06-02 21:38:27] [INFO ] Flatten gal took : 8 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/graph16888403203788147951.txt' '-o' '/tmp/graph16888403203788147951.bin' '-w' '/tmp/graph16888403203788147951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16888403203788147951.bin' '-l' '-1' '-v' '-w' '/tmp/graph16888403203788147951.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:38:27] [INFO ] Decomposing Gal with order
[2025-06-02 21:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:38:27] [INFO ] Removed a total of 449 redundant transitions.
[2025-06-02 21:38:27] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2025-06-02 21:38:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11894248853082179834.gal : 3 ms
[2025-06-02 21:38:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17674753301703446165.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/CTLFireability11894248853082179834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17674753301703446165.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.
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,7.69548e+09,4.49289,95164,1425,43,151839,595,599,320315,68,1721,0
Converting to forward existential form...Done !
original formula: EF(EX(AG((((i6.u36.p328==0)||(i9.u47.p375==0)) + (EG(((i5.u31.p283==1)&&(i7.u40.p343==1))) * ((i5.u27.p259==1)||(i5.u33.p303==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((i6.u36.p328==0)||(i9.u47.p375==0)) + (EG(((i5.u31.p283==1)&&(i7.u40.p343...216
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t137, t139, t140, t148, t168, t175, t177, t178, t193, t200, t202, t203, t208, t209,...874
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 205 transition count 428
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 205 transition count 428
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 108 place count 179 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 134 place count 179 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 179 transition count 386
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 147 place count 167 transition count 360
Iterating global reduction 1 with 12 rules applied. Total rules applied 159 place count 167 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 160 place count 167 transition count 359
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 167 place count 160 transition count 342
Iterating global reduction 2 with 7 rules applied. Total rules applied 174 place count 160 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 178 place count 160 transition count 338
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 183 place count 155 transition count 326
Iterating global reduction 3 with 5 rules applied. Total rules applied 188 place count 155 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 193 place count 155 transition count 321
Applied a total of 193 rules in 19 ms. Remains 155 /246 variables (removed 91) and now considering 321/481 (removed 160) transitions.
// Phase 1: matrix 321 rows 155 cols
[2025-06-02 21:38:57] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:38:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 21:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:38:57] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2025-06-02 21:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/476 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:08] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:16] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:17] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:17] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/476 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 168 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/476 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 320/485 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:33] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:33] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:40] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:39:50] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 60141ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 155/246 places, 321/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 155/246 places, 321/481 transitions.
[2025-06-02 21:39:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:39:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:39:58] [INFO ] Input system was already deterministic with 321 transitions.
[2025-06-02 21:39:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:39:58] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:39:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1987673604687628848.gal : 2 ms
[2025-06-02 21:39:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16994748932506037777.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/CTLFireability1987673604687628848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16994748932506037777.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-02 21:40:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:40:28] [INFO ] Applying decomposition
[2025-06-02 21:40:28] [INFO ] Flatten gal took : 8 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/graph15145687703953549515.txt' '-o' '/tmp/graph15145687703953549515.bin' '-w' '/tmp/graph15145687703953549515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15145687703953549515.bin' '-l' '-1' '-v' '-w' '/tmp/graph15145687703953549515.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:40:28] [INFO ] Decomposing Gal with order
[2025-06-02 21:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:40:28] [INFO ] Removed a total of 468 redundant transitions.
[2025-06-02 21:40:28] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2025-06-02 21:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14819115458862775508.gal : 7 ms
[2025-06-02 21:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability13137190700563474341.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/CTLFireability14819115458862775508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13137190700563474341.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.
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,9.3626e+09,2.88483,55936,1378,54,86947,659,728,202813,76,1825,0
Converting to forward existential form...Done !
original formula: AG(((AG((EF((i4.u11.p92==1)) * EG((i1.u1.p12==1)))) + EX(!(E((((i1.u1.p12==1)&&(u5.p30==1))&&(i4.u12.p93==1)) U (i7.i0.u41.p342==1))))) +...177
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !((i6.i1.u35.p307==0))) * !(EX(!(E((((i1.u1.p12==1)&&(u5.p30==1))&&(i4.u12.p93==1)) ...409
Reverse transition relation is NOT exact ! Due to transitions t20, t54, t121, t139, t141, t142, t177, t179, t180, t202, t204, t205, t213, t214, t215, t216,...939
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,17.1897,342784,1,0,500459,3850,4542,1.52669e+06,441,13499,872643
FORMULA MedleyA-PT-23-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 204 transition count 429
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 204 transition count 429
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 111 place count 177 transition count 385
Iterating global reduction 0 with 27 rules applied. Total rules applied 138 place count 177 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 139 place count 177 transition count 384
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 152 place count 164 transition count 356
Iterating global reduction 1 with 13 rules applied. Total rules applied 165 place count 164 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 166 place count 164 transition count 355
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 157 transition count 337
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 157 transition count 337
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 184 place count 157 transition count 333
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 189 place count 152 transition count 321
Iterating global reduction 3 with 5 rules applied. Total rules applied 194 place count 152 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 199 place count 152 transition count 316
Applied a total of 199 rules in 11 ms. Remains 152 /246 variables (removed 94) and now considering 316/481 (removed 165) transitions.
// Phase 1: matrix 316 rows 152 cols
[2025-06-02 21:40:45] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:40:45] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-02 21:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:40:46] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-02 21:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:40:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/468 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:40:58] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:07] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:08] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:08] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 315 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 468/468 variables, and 165 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/468 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 315/477 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:20] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:45] [INFO ] Deduced a trap along path composed of 9 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:45] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:41:45] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 484 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 152/246 places, 316/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 152/246 places, 316/481 transitions.
[2025-06-02 21:41:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:41:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:41:46] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 21:41:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:41:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4568360095445367578.gal : 3 ms
[2025-06-02 21:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8687382833228134514.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/CTLFireability4568360095445367578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8687382833228134514.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-02 21:42:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:42:16] [INFO ] Applying decomposition
[2025-06-02 21:42:16] [INFO ] Flatten gal took : 12 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/graph369832061504443925.txt' '-o' '/tmp/graph369832061504443925.bin' '-w' '/tmp/graph369832061504443925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph369832061504443925.bin' '-l' '-1' '-v' '-w' '/tmp/graph369832061504443925.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:42:16] [INFO ] Decomposing Gal with order
[2025-06-02 21:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:42:16] [INFO ] Removed a total of 467 redundant transitions.
[2025-06-02 21:42:16] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:42:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-06-02 21:42:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10009125245857849232.gal : 3 ms
[2025-06-02 21:42:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14687703349519046133.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/CTLFireability10009125245857849232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14687703349519046133.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.
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,7.95408e+09,3.64502,79696,1304,43,131589,581,591,258763,68,1648,0
Converting to forward existential form...Done !
original formula: EX(EF(((EG(EX((((i0.u2.p12==1)&&(i5.u6.p30==1))&&(i6.u30.p247==1)))) * EF((i2.u16.p113==0))) * ((i5.u6.p29==0)||(i4.u23.p212==0)))))
=> equivalent forward existential formula: [(FwdU(((FwdU(EY(Init),TRUE) * ((i5.u6.p29==0)||(i4.u23.p212==0))) * EG(EX((((i0.u2.p12==1)&&(i5.u6.p30==1))&&(i...209
Reverse transition relation is NOT exact ! Due to transitions t19, t54, t137, t139, t140, t173, t175, t176, t197, t199, t200, t205, t206, t207, t208, t210,...892
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,12.8935,226000,1,0,385668,2116,3766,804107,388,5890,899033
FORMULA MedleyA-PT-23-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 481/481 transitions.
Graph (trivial) has 189 edges and 246 vertex of which 18 / 246 are part of one of the 2 SCC in 4 ms
Free SCC test removed 16 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 229 transition count 426
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 199 transition count 426
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 61 place count 199 transition count 416
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 81 place count 189 transition count 416
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 124 place count 146 transition count 357
Iterating global reduction 2 with 43 rules applied. Total rules applied 167 place count 146 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 146 transition count 355
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 169 place count 146 transition count 351
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 177 place count 142 transition count 351
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 193 place count 126 transition count 303
Iterating global reduction 3 with 16 rules applied. Total rules applied 209 place count 126 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 214 place count 126 transition count 298
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 125 transition count 296
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 125 transition count 296
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 124 transition count 293
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 124 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 124 transition count 292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 259 place count 104 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 104 transition count 270
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 272 place count 93 transition count 238
Iterating global reduction 6 with 11 rules applied. Total rules applied 283 place count 93 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 286 place count 93 transition count 235
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 290 place count 89 transition count 227
Iterating global reduction 7 with 4 rules applied. Total rules applied 294 place count 89 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 296 place count 89 transition count 225
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 298 place count 87 transition count 219
Iterating global reduction 8 with 2 rules applied. Total rules applied 300 place count 87 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 302 place count 87 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 306 place count 85 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 310 place count 85 transition count 211
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 314 place count 83 transition count 209
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 316 place count 81 transition count 203
Iterating global reduction 9 with 2 rules applied. Total rules applied 318 place count 81 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 320 place count 81 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 322 place count 79 transition count 199
Applied a total of 322 rules in 82 ms. Remains 79 /246 variables (removed 167) and now considering 199/481 (removed 282) transitions.
[2025-06-02 21:42:29] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
// Phase 1: matrix 190 rows 79 cols
[2025-06-02 21:42:29] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:42:30] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-06-02 21:42:30] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2025-06-02 21:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:42:30] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:42:30] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2025-06-02 21:42:30] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2025-06-02 21:42:30] [INFO ] Invariant cache hit.
[2025-06-02 21:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 189/265 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 3/268 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:42:38] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 89 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14657 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 189/265 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:42:49] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 3/268 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 151/271 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/269 variables, and 271 constraints, problems are : Problem set: 0 solved, 181 unsolved in 19273 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33962ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 33963ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/246 places, 199/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34563 ms. Remains : 79/246 places, 199/481 transitions.
[2025-06-02 21:43:04] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:43:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:43:04] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-02 21:43:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:43:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1793456775462626137.gal : 1 ms
[2025-06-02 21:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2236314779147492115.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/CTLFireability1793456775462626137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2236314779147492115.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,1.15825e+07,2.46687,51204,2,5647,5,172511,6,0,512,200577,0
Converting to forward existential form...Done !
original formula: AG(AF((p331==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p331==1)))] = FALSE
Hit Full ! (commute/partial/dont) 189/0/10
(forward)formula 0,0,4.69885,72148,1,0,10,352476,20,3,2952,212299,8
FORMULA MedleyA-PT-23-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 21:43:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 21:43:08] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:43:08] [INFO ] Applying decomposition
[2025-06-02 21:43:09] [INFO ] Flatten gal took : 12 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/graph13148205195286775014.txt' '-o' '/tmp/graph13148205195286775014.bin' '-w' '/tmp/graph13148205195286775014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13148205195286775014.bin' '-l' '-1' '-v' '-w' '/tmp/graph13148205195286775014.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:43:09] [INFO ] Decomposing Gal with order
[2025-06-02 21:43:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:43:09] [INFO ] Removed a total of 712 redundant transitions.
[2025-06-02 21:43:09] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:43:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2025-06-02 21:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17254931273822550633.gal : 5 ms
[2025-06-02 21:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4094787499858758764.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/CTLFireability17254931273822550633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4094787499858758764.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20261e+11,42.4738,705536,7624,99,1.11787e+06,1088,1039,2.4174e+06,92,3987,0
Converting to forward existential form...Done !
original formula: ((EF(EX((((i2.u11.p131==0)||(i8.i1.i0.u50.p235==0)) * !(A((i8.i0.i0.u51.p317==1) U (i8.i1.i2.u61.p294==1)))))) * A(((AX(EG((i8.i0.i0.u56....613
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX((((i2.u11.p131==0)||(i8.i1.i0.u50.p235==0)) * !(!((E(!((i8.i1.i2.u61.p294==1)) U (!((i8...1164
Reverse transition relation is NOT exact ! Due to transitions t121, t148, t207, t224, t225, t227, t228, t229, t230, t237, t239, t240, t241, t242, t261, t26...1637
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 17
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
[2025-06-02 22:11:52] [INFO ] Applying decomposition
[2025-06-02 22:11:52] [INFO ] Flatten gal took : 12 ms
[2025-06-02 22:11:52] [INFO ] Decomposing Gal with order
[2025-06-02 22:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:11:52] [INFO ] Removed a total of 500 redundant transitions.
[2025-06-02 22:11:52] [INFO ] Flatten gal took : 27 ms
[2025-06-02 22:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 289 labels/synchronizations in 8 ms.
[2025-06-02 22:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6644765690372574328.gal : 3 ms
[2025-06-02 22:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability292065436727483585.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/CTLFireability6644765690372574328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability292065436727483585.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20261e+11,281.639,5329544,4389,7592,6.69176e+06,753954,325,3.2855e+07,561,1.74482e+07,0
Converting to forward existential form...Done !
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r128-smll-174876524200274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-23.tgz
mv MedleyA-PT-23 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 ;