About the Execution of ITS-Tools for DiscoveryGPU-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10103.672 | 3600000.00 | 3717994.00 | 8528.00 | ????????T??????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132700466.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DiscoveryGPU-PT-12b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700466
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 89K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716380065150
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 12:14:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 12:14:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:14:26] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-22 12:14:26] [INFO ] Transformed 352 places.
[2024-05-22 12:14:26] [INFO ] Transformed 374 transitions.
[2024-05-22 12:14:26] [INFO ] Found NUPN structural information;
[2024-05-22 12:14:26] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 138 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 50 place count 302 transition count 348
Iterating global reduction 1 with 26 rules applied. Total rules applied 76 place count 302 transition count 348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 301 transition count 347
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 301 transition count 347
Applied a total of 78 rules in 62 ms. Remains 301 /352 variables (removed 51) and now considering 347/374 (removed 27) transitions.
// Phase 1: matrix 347 rows 301 cols
[2024-05-22 12:14:26] [INFO ] Computed 2 invariants in 20 ms
[2024-05-22 12:14:26] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 12:14:26] [INFO ] Invariant cache hit.
[2024-05-22 12:14:27] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-05-22 12:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 347/648 variables, 301/303 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 21 ms to minimize.
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 20 ms to minimize.
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 5 ms to minimize.
[2024-05-22 12:14:35] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-22 12:14:36] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-22 12:14:37] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 330 constraints, problems are : Problem set: 0 solved, 346 unsolved in 22240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (OVERLAPS) 347/648 variables, 301/330 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 346/676 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 676 constraints, problems are : Problem set: 0 solved, 346 unsolved in 21029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 27/27 constraints]
After SMT, in 43476ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 43511ms
Starting structural reductions in LTL mode, iteration 1 : 301/352 places, 347/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44061 ms. Remains : 301/352 places, 347/374 transitions.
Support contains 138 out of 301 places after structural reductions.
[2024-05-22 12:15:10] [INFO ] Flatten gal took : 55 ms
[2024-05-22 12:15:10] [INFO ] Flatten gal took : 31 ms
[2024-05-22 12:15:11] [INFO ] Input system was already deterministic with 347 transitions.
RANDOM walk for 40000 steps (101 resets) in 2045 ms. (19 steps per ms) remains 4/112 properties
BEST_FIRST walk for 40003 steps (12 resets) in 174 ms. (228 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2024-05-22 12:15:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 144/174 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 388/562 variables, 197/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp81 is UNSAT
At refinement iteration 9 (OVERLAPS) 79/641 variables, 67/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/648 variables, 7/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 303 constraints, problems are : Problem set: 1 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 141/169 variables, 28/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 392/561 variables, 198/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 2/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 80/641 variables, 68/298 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/648 variables, 7/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/648 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 305 constraints, problems are : Problem set: 1 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 188 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=94 )
Parikh walk visited 2 properties in 58 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 12:15:12] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:15:12] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:15:12] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 135 out of 301 places (down from 136) after GAL structural reductions.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 565 edges and 301 vertex of which 288 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 261 transition count 307
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 261 transition count 307
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 92 place count 249 transition count 295
Iterating global reduction 0 with 12 rules applied. Total rules applied 104 place count 249 transition count 295
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 115 place count 238 transition count 284
Iterating global reduction 0 with 11 rules applied. Total rules applied 126 place count 238 transition count 284
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 228 transition count 271
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 228 transition count 271
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 156 place count 218 transition count 254
Iterating global reduction 0 with 10 rules applied. Total rules applied 166 place count 218 transition count 254
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 175 place count 209 transition count 245
Iterating global reduction 0 with 9 rules applied. Total rules applied 184 place count 209 transition count 245
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 190 place count 203 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 196 place count 203 transition count 239
Applied a total of 196 rules in 39 ms. Remains 203 /301 variables (removed 98) and now considering 239/347 (removed 108) transitions.
// Phase 1: matrix 239 rows 203 cols
[2024-05-22 12:15:12] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 12:15:12] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 12:15:12] [INFO ] Invariant cache hit.
[2024-05-22 12:15:13] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-22 12:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 239/442 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 12:15:16] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:15:16] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:15:16] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:15:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:15:17] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/442 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 225 constraints, problems are : Problem set: 0 solved, 238 unsolved in 8798 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/442 variables, 203/225 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 238/463 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 463 constraints, problems are : Problem set: 0 solved, 238 unsolved in 10635 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 20/20 constraints]
After SMT, in 19527ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 19530ms
Starting structural reductions in LTL mode, iteration 1 : 203/301 places, 239/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19758 ms. Remains : 203/301 places, 239/347 transitions.
[2024-05-22 12:15:32] [INFO ] Flatten gal took : 14 ms
[2024-05-22 12:15:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:15:32] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-22 12:15:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:15:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:15:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6234843698393025794.gal : 4 ms
[2024-05-22 12:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6680509355024747696.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6234843698393025794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6680509355024747696.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:16:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:16:02] [INFO ] Applying decomposition
[2024-05-22 12:16:02] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph16413972364998673565.txt' '-o' '/tmp/graph16413972364998673565.bin' '-w' '/tmp/graph16413972364998673565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16413972364998673565.bin' '-l' '-1' '-v' '-w' '/tmp/graph16413972364998673565.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:16:02] [INFO ] Decomposing Gal with order
[2024-05-22 12:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:16:02] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-22 12:16:02] [INFO ] Flatten gal took : 55 ms
[2024-05-22 12:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2024-05-22 12:16:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5010976361284082631.gal : 6 ms
[2024-05-22 12:16:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4105930416764530762.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5010976361284082631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4105930416764530762.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 263 transition count 309
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 263 transition count 309
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 252 transition count 298
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 252 transition count 298
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 241 transition count 287
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 241 transition count 287
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 131 place count 230 transition count 273
Iterating global reduction 0 with 11 rules applied. Total rules applied 142 place count 230 transition count 273
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 220 transition count 256
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 220 transition count 256
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 210 transition count 246
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 210 transition count 246
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 188 place count 204 transition count 240
Iterating global reduction 0 with 6 rules applied. Total rules applied 194 place count 204 transition count 240
Applied a total of 194 rules in 42 ms. Remains 204 /301 variables (removed 97) and now considering 240/347 (removed 107) transitions.
// Phase 1: matrix 240 rows 204 cols
[2024-05-22 12:16:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:16:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 12:16:33] [INFO ] Invariant cache hit.
[2024-05-22 12:16:33] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-22 12:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 240/444 variables, 204/206 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:16:37] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:16:38] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 229 constraints, problems are : Problem set: 0 solved, 239 unsolved in 10714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/444 variables, 204/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 239/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 468 constraints, problems are : Problem set: 0 solved, 239 unsolved in 11054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 23/23 constraints]
After SMT, in 21844ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 21847ms
Starting structural reductions in LTL mode, iteration 1 : 204/301 places, 240/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22082 ms. Remains : 204/301 places, 240/347 transitions.
[2024-05-22 12:16:55] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:16:55] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:16:55] [INFO ] Input system was already deterministic with 240 transitions.
[2024-05-22 12:16:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:16:55] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:16:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18096383903142472744.gal : 16 ms
[2024-05-22 12:16:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4960861931193520212.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18096383903142472744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4960861931193520212.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:17:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:17:25] [INFO ] Applying decomposition
[2024-05-22 12:17:25] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15059273485643312393.txt' '-o' '/tmp/graph15059273485643312393.bin' '-w' '/tmp/graph15059273485643312393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15059273485643312393.bin' '-l' '-1' '-v' '-w' '/tmp/graph15059273485643312393.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:17:25] [INFO ] Decomposing Gal with order
[2024-05-22 12:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:17:25] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-22 12:17:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 12:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4580928802203281534.gal : 11 ms
[2024-05-22 12:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8790707768975469562.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4580928802203281534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8790707768975469562.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 271 transition count 317
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 271 transition count 317
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 263 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 263 transition count 309
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 257 transition count 303
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 257 transition count 303
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 254 transition count 300
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 254 transition count 300
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 251 transition count 294
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 251 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 248 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 248 transition count 291
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 245 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 245 transition count 288
Applied a total of 112 rules in 35 ms. Remains 245 /301 variables (removed 56) and now considering 288/347 (removed 59) transitions.
// Phase 1: matrix 288 rows 245 cols
[2024-05-22 12:17:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:17:55] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 12:17:55] [INFO ] Invariant cache hit.
[2024-05-22 12:17:55] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-22 12:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/533 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:18:01] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-22 12:18:02] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 269 constraints, problems are : Problem set: 0 solved, 287 unsolved in 14751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/533 variables, 245/269 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 287/556 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 556 constraints, problems are : Problem set: 0 solved, 287 unsolved in 15410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 22/22 constraints]
After SMT, in 30278ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 30280ms
Starting structural reductions in LTL mode, iteration 1 : 245/301 places, 288/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30617 ms. Remains : 245/301 places, 288/347 transitions.
[2024-05-22 12:18:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:18:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:18:26] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-22 12:18:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:18:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:18:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3446857370467400795.gal : 6 ms
[2024-05-22 12:18:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17922583732802820831.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3446857370467400795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17922583732802820831.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:18:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:18:56] [INFO ] Applying decomposition
[2024-05-22 12:18:56] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph15965691842851974092.txt' '-o' '/tmp/graph15965691842851974092.bin' '-w' '/tmp/graph15965691842851974092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15965691842851974092.bin' '-l' '-1' '-v' '-w' '/tmp/graph15965691842851974092.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:18:56] [INFO ] Decomposing Gal with order
[2024-05-22 12:18:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:18:56] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-22 12:18:56] [INFO ] Flatten gal took : 20 ms
[2024-05-22 12:18:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 3 ms.
[2024-05-22 12:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11538800501578767523.gal : 6 ms
[2024-05-22 12:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9665138146601816228.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11538800501578767523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9665138146601816228.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Graph (complete) has 565 edges and 301 vertex of which 288 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 287 transition count 275
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 229 transition count 275
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 117 place count 229 transition count 251
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 165 place count 205 transition count 251
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 178 place count 192 transition count 238
Iterating global reduction 2 with 13 rules applied. Total rules applied 191 place count 192 transition count 238
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 200 place count 183 transition count 229
Iterating global reduction 2 with 9 rules applied. Total rules applied 209 place count 183 transition count 229
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 218 place count 174 transition count 217
Iterating global reduction 2 with 9 rules applied. Total rules applied 227 place count 174 transition count 217
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 235 place count 166 transition count 204
Iterating global reduction 2 with 8 rules applied. Total rules applied 243 place count 166 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 248 place count 161 transition count 199
Iterating global reduction 2 with 5 rules applied. Total rules applied 253 place count 161 transition count 199
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 311 place count 132 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 131 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 131 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 314 place count 130 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 315 place count 130 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 316 place count 129 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 317 place count 129 transition count 166
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 129 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 127 transition count 164
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 333 place count 126 transition count 153
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 345 place count 115 transition count 152
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 347 place count 114 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 347 place count 114 transition count 150
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 349 place count 113 transition count 150
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 5 with 2 rules applied. Total rules applied 351 place count 112 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 352 place count 112 transition count 148
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 6 with 2 rules applied. Total rules applied 354 place count 111 transition count 147
Applied a total of 354 rules in 75 ms. Remains 111 /301 variables (removed 190) and now considering 147/347 (removed 200) transitions.
// Phase 1: matrix 147 rows 111 cols
[2024-05-22 12:19:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 12:19:26] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 12:19:26] [INFO ] Invariant cache hit.
[2024-05-22 12:19:26] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-22 12:19:26] [INFO ] Redundant transitions in 3 ms returned []
Running 146 sub problems to find dead transitions.
[2024-05-22 12:19:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/258 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 0/258 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 112 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/258 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 146/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 258 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 5331ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 5333ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/301 places, 147/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5555 ms. Remains : 111/301 places, 147/347 transitions.
[2024-05-22 12:19:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:19:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:19:32] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 12:19:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:19:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:19:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16850455002533211969.gal : 1 ms
[2024-05-22 12:19:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5741892608312673095.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16850455002533211969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5741892608312673095.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.85047e+12,3.4525,107304,2,36974,5,656169,6,0,571,414909,0
Converting to forward existential form...Done !
original formula: (EF((((p234==0)||(p343==0)) * A((AG(((p52==1)&&(p343==1))) * !((((p86==1)&&(p343==1))||(p42==1)))) U (!(((p324==1)&&(p343==1))) * A((p134...197
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((p234==0)||(p343==0)) * !((E(!((!(((p324==1)&&(p343==1))) * !((E(!((p237==1)) U (!((p134=...560
Reverse transition relation is NOT exact ! Due to transitions t2, t13, t18, t25, t30, t35, t40, t46, t51, t56, t60, t65, t127, t131, t134, t136, t137, t138...305
Detected timeout of ITS tools.
[2024-05-22 12:20:02] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:20:02] [INFO ] Applying decomposition
[2024-05-22 12:20:02] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9529509830893460205.txt' '-o' '/tmp/graph9529509830893460205.bin' '-w' '/tmp/graph9529509830893460205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9529509830893460205.bin' '-l' '-1' '-v' '-w' '/tmp/graph9529509830893460205.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:20:02] [INFO ] Decomposing Gal with order
[2024-05-22 12:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:20:02] [INFO ] Removed a total of 72 redundant transitions.
[2024-05-22 12:20:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 3 ms.
[2024-05-22 12:20:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17209324554359175898.gal : 1 ms
[2024-05-22 12:20:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14757003252905855837.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17209324554359175898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14757003252905855837.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,3.85047e+12,16.3446,582400,5847,151,721994,2801,319,5.87421e+06,45,28434,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 260 transition count 306
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 260 transition count 306
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 250 transition count 296
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 250 transition count 296
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 241 transition count 287
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 241 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 233 transition count 276
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 233 transition count 276
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 143 place count 226 transition count 264
Iterating global reduction 0 with 7 rules applied. Total rules applied 150 place count 226 transition count 264
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 157 place count 219 transition count 257
Iterating global reduction 0 with 7 rules applied. Total rules applied 164 place count 219 transition count 257
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 169 place count 214 transition count 252
Iterating global reduction 0 with 5 rules applied. Total rules applied 174 place count 214 transition count 252
Applied a total of 174 rules in 22 ms. Remains 214 /301 variables (removed 87) and now considering 252/347 (removed 95) transitions.
// Phase 1: matrix 252 rows 214 cols
[2024-05-22 12:20:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:20:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 12:20:32] [INFO ] Invariant cache hit.
[2024-05-22 12:20:32] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-22 12:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (OVERLAPS) 252/466 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:20:36] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:20:37] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/236 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 236 constraints, problems are : Problem set: 0 solved, 251 unsolved in 9767 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/466 variables, 214/236 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 251/487 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 487 constraints, problems are : Problem set: 0 solved, 251 unsolved in 12018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 20/20 constraints]
After SMT, in 21858ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 21860ms
Starting structural reductions in LTL mode, iteration 1 : 214/301 places, 252/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22086 ms. Remains : 214/301 places, 252/347 transitions.
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:20:54] [INFO ] Input system was already deterministic with 252 transitions.
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:20:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:20:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9424368676024576473.gal : 1 ms
[2024-05-22 12:20:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13777367186493007116.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9424368676024576473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13777367186493007116.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:21:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 12:21:24] [INFO ] Applying decomposition
[2024-05-22 12:21:24] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7615102775990126543.txt' '-o' '/tmp/graph7615102775990126543.bin' '-w' '/tmp/graph7615102775990126543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7615102775990126543.bin' '-l' '-1' '-v' '-w' '/tmp/graph7615102775990126543.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:21:24] [INFO ] Decomposing Gal with order
[2024-05-22 12:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:21:24] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-22 12:21:24] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-22 12:21:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7877259700383087539.gal : 3 ms
[2024-05-22 12:21:24] [INFO ] Time to serialize properties into /tmp/CTLFireability15598204732288482273.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7877259700383087539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15598204732288482273.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 260 transition count 306
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 260 transition count 306
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 248 transition count 294
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 248 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 117 place count 237 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 128 place count 237 transition count 283
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 138 place count 227 transition count 271
Iterating global reduction 0 with 10 rules applied. Total rules applied 148 place count 227 transition count 271
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 157 place count 218 transition count 255
Iterating global reduction 0 with 9 rules applied. Total rules applied 166 place count 218 transition count 255
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 175 place count 209 transition count 246
Iterating global reduction 0 with 9 rules applied. Total rules applied 184 place count 209 transition count 246
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 191 place count 202 transition count 239
Iterating global reduction 0 with 7 rules applied. Total rules applied 198 place count 202 transition count 239
Applied a total of 198 rules in 21 ms. Remains 202 /301 variables (removed 99) and now considering 239/347 (removed 108) transitions.
// Phase 1: matrix 239 rows 202 cols
[2024-05-22 12:21:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:21:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 12:21:54] [INFO ] Invariant cache hit.
[2024-05-22 12:21:54] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-22 12:21:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 239/441 variables, 202/204 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:21:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:21:59] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 15/219 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 219 constraints, problems are : Problem set: 0 solved, 238 unsolved in 9945 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/441 variables, 202/219 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 238/457 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 457 constraints, problems are : Problem set: 0 solved, 238 unsolved in 10623 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 15/15 constraints]
After SMT, in 20640ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 20643ms
Starting structural reductions in LTL mode, iteration 1 : 202/301 places, 239/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20865 ms. Remains : 202/301 places, 239/347 transitions.
[2024-05-22 12:22:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:22:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:22:15] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-22 12:22:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:22:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:22:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8755843174657731486.gal : 1 ms
[2024-05-22 12:22:15] [INFO ] Time to serialize properties into /tmp/CTLFireability314529829188179077.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8755843174657731486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability314529829188179077.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:22:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:22:45] [INFO ] Applying decomposition
[2024-05-22 12:22:45] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph2088750390539945110.txt' '-o' '/tmp/graph2088750390539945110.bin' '-w' '/tmp/graph2088750390539945110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2088750390539945110.bin' '-l' '-1' '-v' '-w' '/tmp/graph2088750390539945110.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:22:45] [INFO ] Decomposing Gal with order
[2024-05-22 12:22:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:22:45] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-22 12:22:45] [INFO ] Flatten gal took : 14 ms
[2024-05-22 12:22:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 12:22:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10532740245618182402.gal : 2 ms
[2024-05-22 12:22:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9877412936818345503.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10532740245618182402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9877412936818345503.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 259 transition count 305
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 259 transition count 305
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 96 place count 247 transition count 293
Iterating global reduction 0 with 12 rules applied. Total rules applied 108 place count 247 transition count 293
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 236 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 236 transition count 282
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 140 place count 226 transition count 269
Iterating global reduction 0 with 10 rules applied. Total rules applied 150 place count 226 transition count 269
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 160 place count 216 transition count 252
Iterating global reduction 0 with 10 rules applied. Total rules applied 170 place count 216 transition count 252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 180 place count 206 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 190 place count 206 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 197 place count 199 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 204 place count 199 transition count 235
Applied a total of 204 rules in 39 ms. Remains 199 /301 variables (removed 102) and now considering 235/347 (removed 112) transitions.
// Phase 1: matrix 235 rows 199 cols
[2024-05-22 12:23:15] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 12:23:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 12:23:15] [INFO ] Invariant cache hit.
[2024-05-22 12:23:15] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-22 12:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/434 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
[2024-05-22 12:23:19] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 12:23:20] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 227 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/434 variables, 199/227 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 234/461 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 461 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 26/26 constraints]
After SMT, in 20644ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 20647ms
Starting structural reductions in LTL mode, iteration 1 : 199/301 places, 235/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20866 ms. Remains : 199/301 places, 235/347 transitions.
[2024-05-22 12:23:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:23:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:23:36] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-22 12:23:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:23:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:23:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14761099718539143775.gal : 1 ms
[2024-05-22 12:23:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17797867938946524142.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14761099718539143775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17797867938946524142.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:24:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:24:06] [INFO ] Applying decomposition
[2024-05-22 12:24:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph714404361115795501.txt' '-o' '/tmp/graph714404361115795501.bin' '-w' '/tmp/graph714404361115795501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph714404361115795501.bin' '-l' '-1' '-v' '-w' '/tmp/graph714404361115795501.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:24:06] [INFO ] Decomposing Gal with order
[2024-05-22 12:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:24:06] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-22 12:24:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 12:24:06] [INFO ] Time to serialize gal into /tmp/CTLFireability18421157344992134270.gal : 2 ms
[2024-05-22 12:24:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9753749998801302213.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18421157344992134270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9753749998801302213.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 267 transition count 313
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 267 transition count 313
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 80 place count 255 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 92 place count 255 transition count 301
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 102 place count 245 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 112 place count 245 transition count 291
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 237 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 237 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 136 place count 229 transition count 267
Iterating global reduction 0 with 8 rules applied. Total rules applied 144 place count 229 transition count 267
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 151 place count 222 transition count 260
Iterating global reduction 0 with 7 rules applied. Total rules applied 158 place count 222 transition count 260
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 165 place count 215 transition count 253
Iterating global reduction 0 with 7 rules applied. Total rules applied 172 place count 215 transition count 253
Applied a total of 172 rules in 13 ms. Remains 215 /301 variables (removed 86) and now considering 253/347 (removed 94) transitions.
// Phase 1: matrix 253 rows 215 cols
[2024-05-22 12:24:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:24:36] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 12:24:36] [INFO ] Invariant cache hit.
[2024-05-22 12:24:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-22 12:24:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/468 variables, 215/217 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-22 12:24:41] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:24:42] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 240 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/468 variables, 215/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 252/492 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 492 constraints, problems are : Problem set: 0 solved, 252 unsolved in 13195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 23/23 constraints]
After SMT, in 24792ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 24795ms
Starting structural reductions in LTL mode, iteration 1 : 215/301 places, 253/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24984 ms. Remains : 215/301 places, 253/347 transitions.
[2024-05-22 12:25:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:25:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:25:01] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-22 12:25:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:25:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:25:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11090317969663616272.gal : 2 ms
[2024-05-22 12:25:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8997181719443837511.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11090317969663616272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8997181719443837511.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:25:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:25:31] [INFO ] Applying decomposition
[2024-05-22 12:25:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6955283429304991865.txt' '-o' '/tmp/graph6955283429304991865.bin' '-w' '/tmp/graph6955283429304991865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6955283429304991865.bin' '-l' '-1' '-v' '-w' '/tmp/graph6955283429304991865.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:25:31] [INFO ] Decomposing Gal with order
[2024-05-22 12:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:25:31] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-22 12:25:31] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2024-05-22 12:25:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14230570565305174315.gal : 2 ms
[2024-05-22 12:25:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14152704487387345534.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14230570565305174315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14152704487387345534.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Graph (complete) has 565 edges and 301 vertex of which 289 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.10 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 288 transition count 276
Reduce places removed 58 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 230 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 227 transition count 273
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 123 place count 227 transition count 250
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 169 place count 204 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 181 place count 192 transition count 238
Iterating global reduction 3 with 12 rules applied. Total rules applied 193 place count 192 transition count 238
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 202 place count 183 transition count 229
Iterating global reduction 3 with 9 rules applied. Total rules applied 211 place count 183 transition count 229
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 220 place count 174 transition count 218
Iterating global reduction 3 with 9 rules applied. Total rules applied 229 place count 174 transition count 218
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 238 place count 165 transition count 202
Iterating global reduction 3 with 9 rules applied. Total rules applied 247 place count 165 transition count 202
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 254 place count 158 transition count 195
Iterating global reduction 3 with 7 rules applied. Total rules applied 261 place count 158 transition count 195
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 319 place count 129 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 128 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 128 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 127 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 127 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 324 place count 126 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 126 transition count 162
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 126 transition count 162
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 124 transition count 160
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 15 rules applied. Total rules applied 344 place count 123 transition count 146
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 18 rules applied. Total rules applied 362 place count 109 transition count 142
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 365 place count 107 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 366 place count 106 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 366 place count 106 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 105 transition count 140
Applied a total of 368 rules in 72 ms. Remains 105 /301 variables (removed 196) and now considering 140/347 (removed 207) transitions.
// Phase 1: matrix 140 rows 105 cols
[2024-05-22 12:26:01] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 12:26:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 12:26:02] [INFO ] Invariant cache hit.
[2024-05-22 12:26:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 12:26:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-22 12:26:02] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-22 12:26:02] [INFO ] Invariant cache hit.
[2024-05-22 12:26:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 140/244 variables, 104/105 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 1/245 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 107 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 140/244 variables, 104/105 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 138/244 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 245 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3790 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 6809ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 6810ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/301 places, 140/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7020 ms. Remains : 105/301 places, 140/347 transitions.
[2024-05-22 12:26:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:26:08] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:26:08] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-22 12:26:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:26:08] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9222442212686914580.gal : 1 ms
[2024-05-22 12:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13693271192471666961.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9222442212686914580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13693271192471666961.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21605e+12,2.91174,93244,2,20502,5,595128,6,0,539,329350,0
Converting to forward existential form...Done !
original formula: EF((AG(EF((p118==0))) + ((AF((p158==1)) * E(((p58!=1) + AF(((p99==1)&&(p343==1)))) U EG(((p119==1)&&(p343==1))))) * ((p278==1)&&((p294==0...172
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (p118==0))))))] != FALSE + [FwdG(FwdU(((FwdU(Init,TRUE) * ((p278==1)&...284
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t11, t13, t17, t19, t23, t25, t29, t31, t35, t38, t41, t43, t49, t56, t58, t62, t63, ...287
(forward)formula 0,1,24.6894,640472,1,0,298,3.60588e+06,301,128,3517,3.4768e+06,290
FORMULA DiscoveryGPU-PT-12b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 264 transition count 310
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 264 transition count 310
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 254 transition count 300
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 254 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 247 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 247 transition count 293
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 240 transition count 285
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 240 transition count 285
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 129 place count 233 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 136 place count 233 transition count 272
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 143 place count 226 transition count 265
Iterating global reduction 0 with 7 rules applied. Total rules applied 150 place count 226 transition count 265
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 156 place count 220 transition count 259
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 220 transition count 259
Applied a total of 162 rules in 21 ms. Remains 220 /301 variables (removed 81) and now considering 259/347 (removed 88) transitions.
// Phase 1: matrix 259 rows 220 cols
[2024-05-22 12:26:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:26:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 12:26:33] [INFO ] Invariant cache hit.
[2024-05-22 12:26:34] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-22 12:26:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/479 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:26:38] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:26:39] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 17/239 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 239 constraints, problems are : Problem set: 0 solved, 258 unsolved in 11700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/479 variables, 220/239 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 258/497 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 497 constraints, problems are : Problem set: 0 solved, 258 unsolved in 12306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 17/17 constraints]
After SMT, in 24081ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 24083ms
Starting structural reductions in LTL mode, iteration 1 : 220/301 places, 259/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24292 ms. Remains : 220/301 places, 259/347 transitions.
[2024-05-22 12:26:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:26:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:26:58] [INFO ] Input system was already deterministic with 259 transitions.
[2024-05-22 12:26:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:26:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7920782744444333986.gal : 1 ms
[2024-05-22 12:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5077405516131453703.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7920782744444333986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5077405516131453703.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:27:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:27:28] [INFO ] Applying decomposition
[2024-05-22 12:27:28] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16782612099717508362.txt' '-o' '/tmp/graph16782612099717508362.bin' '-w' '/tmp/graph16782612099717508362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16782612099717508362.bin' '-l' '-1' '-v' '-w' '/tmp/graph16782612099717508362.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:27:28] [INFO ] Decomposing Gal with order
[2024-05-22 12:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:27:28] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-22 12:27:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2024-05-22 12:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16713162188364008884.gal : 3 ms
[2024-05-22 12:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5941149390853343169.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16713162188364008884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5941149390853343169.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 266 transition count 312
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 266 transition count 312
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 258 transition count 304
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 258 transition count 304
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 251 transition count 297
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 251 transition count 297
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 244 transition count 288
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 place count 244 transition count 288
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 240 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 240 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 236 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 236 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 234 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 234 transition count 276
Applied a total of 134 rules in 26 ms. Remains 234 /301 variables (removed 67) and now considering 276/347 (removed 71) transitions.
// Phase 1: matrix 276 rows 234 cols
[2024-05-22 12:27:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:27:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 12:27:58] [INFO ] Invariant cache hit.
[2024-05-22 12:27:58] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-22 12:27:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 276/510 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:28:03] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 3 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-22 12:28:04] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:28:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:28:05] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/510 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 260 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/510 variables, 234/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 275/535 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/510 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 535 constraints, problems are : Problem set: 0 solved, 275 unsolved in 14550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 24/24 constraints]
After SMT, in 28206ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 28210ms
Starting structural reductions in LTL mode, iteration 1 : 234/301 places, 276/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28444 ms. Remains : 234/301 places, 276/347 transitions.
[2024-05-22 12:28:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:28:26] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:26] [INFO ] Input system was already deterministic with 276 transitions.
[2024-05-22 12:28:26] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:26] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11336202171581043506.gal : 2 ms
[2024-05-22 12:28:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7482068097664501350.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11336202171581043506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7482068097664501350.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:28:56] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:56] [INFO ] Applying decomposition
[2024-05-22 12:28:56] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6231619851544928724.txt' '-o' '/tmp/graph6231619851544928724.bin' '-w' '/tmp/graph6231619851544928724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6231619851544928724.bin' '-l' '-1' '-v' '-w' '/tmp/graph6231619851544928724.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:28:56] [INFO ] Decomposing Gal with order
[2024-05-22 12:28:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:28:56] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-22 12:28:56] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:28:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 12:28:56] [INFO ] Time to serialize gal into /tmp/CTLFireability269425818648195857.gal : 2 ms
[2024-05-22 12:28:56] [INFO ] Time to serialize properties into /tmp/CTLFireability311602469579369584.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability269425818648195857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability311602469579369584.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 262 transition count 308
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 262 transition count 308
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 251 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 251 transition count 297
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 110 place count 241 transition count 287
Iterating global reduction 0 with 10 rules applied. Total rules applied 120 place count 241 transition count 287
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 129 place count 232 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 138 place count 232 transition count 275
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 224 transition count 261
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 224 transition count 261
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 162 place count 216 transition count 253
Iterating global reduction 0 with 8 rules applied. Total rules applied 170 place count 216 transition count 253
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 210 transition count 247
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 210 transition count 247
Applied a total of 182 rules in 18 ms. Remains 210 /301 variables (removed 91) and now considering 247/347 (removed 100) transitions.
// Phase 1: matrix 247 rows 210 cols
[2024-05-22 12:29:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:29:27] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 12:29:27] [INFO ] Invariant cache hit.
[2024-05-22 12:29:27] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-05-22 12:29:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 247/457 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:29:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:29:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:29:32] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:29:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:29:32] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 19/231 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 231 constraints, problems are : Problem set: 0 solved, 246 unsolved in 10516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/457 variables, 210/231 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 246/477 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 477 constraints, problems are : Problem set: 0 solved, 246 unsolved in 11075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 19/19 constraints]
After SMT, in 21658ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 21660ms
Starting structural reductions in LTL mode, iteration 1 : 210/301 places, 247/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21857 ms. Remains : 210/301 places, 247/347 transitions.
[2024-05-22 12:29:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:29:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:29:48] [INFO ] Input system was already deterministic with 247 transitions.
[2024-05-22 12:29:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:29:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4216996939616860193.gal : 2 ms
[2024-05-22 12:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability18039577193220715158.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4216996939616860193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18039577193220715158.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:30:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:30:19] [INFO ] Applying decomposition
[2024-05-22 12:30:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6787222500039263726.txt' '-o' '/tmp/graph6787222500039263726.bin' '-w' '/tmp/graph6787222500039263726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6787222500039263726.bin' '-l' '-1' '-v' '-w' '/tmp/graph6787222500039263726.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:30:19] [INFO ] Decomposing Gal with order
[2024-05-22 12:30:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:30:19] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-22 12:30:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:30:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2024-05-22 12:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10068130739127588452.gal : 2 ms
[2024-05-22 12:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3334286637024826439.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10068130739127588452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3334286637024826439.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Graph (complete) has 565 edges and 301 vertex of which 288 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 287 transition count 276
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 230 transition count 276
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 115 place count 230 transition count 251
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 165 place count 205 transition count 251
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 178 place count 192 transition count 238
Iterating global reduction 2 with 13 rules applied. Total rules applied 191 place count 192 transition count 238
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 201 place count 182 transition count 228
Iterating global reduction 2 with 10 rules applied. Total rules applied 211 place count 182 transition count 228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 220 place count 173 transition count 217
Iterating global reduction 2 with 9 rules applied. Total rules applied 229 place count 173 transition count 217
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 237 place count 165 transition count 203
Iterating global reduction 2 with 8 rules applied. Total rules applied 245 place count 165 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 251 place count 159 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 257 place count 159 transition count 197
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 315 place count 130 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 316 place count 129 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 317 place count 129 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 128 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 128 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 127 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 127 transition count 164
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 325 place count 127 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 327 place count 125 transition count 162
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 340 place count 124 transition count 150
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 352 place count 112 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 352 place count 112 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 354 place count 111 transition count 149
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 4 with 2 rules applied. Total rules applied 356 place count 110 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 358 place count 110 transition count 146
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 5 with 2 rules applied. Total rules applied 360 place count 109 transition count 145
Applied a total of 360 rules in 55 ms. Remains 109 /301 variables (removed 192) and now considering 145/347 (removed 202) transitions.
[2024-05-22 12:30:49] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
// Phase 1: matrix 144 rows 109 cols
[2024-05-22 12:30:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 12:30:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 12:30:49] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
[2024-05-22 12:30:49] [INFO ] Invariant cache hit.
[2024-05-22 12:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 12:30:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 12:30:49] [INFO ] Redundant transitions in 12 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-22 12:30:49] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
[2024-05-22 12:30:49] [INFO ] Invariant cache hit.
[2024-05-22 12:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 144/253 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 111 constraints, problems are : Problem set: 0 solved, 144 unsolved in 2839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 144/253 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 144/255 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 255 constraints, problems are : Problem set: 0 solved, 144 unsolved in 2912 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 5816ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 5817ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/301 places, 145/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6010 ms. Remains : 109/301 places, 145/347 transitions.
[2024-05-22 12:30:55] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:30:55] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:30:55] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 12:30:55] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:30:55] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:30:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16640121263607105070.gal : 0 ms
[2024-05-22 12:30:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8486606131907752695.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16640121263607105070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8486606131907752695.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.30937e+12,5.68454,164208,2,54750,5,1.09961e+06,6,0,561,555876,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 12:31:25] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:31:25] [INFO ] Applying decomposition
[2024-05-22 12:31:25] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9313860701711450575.txt' '-o' '/tmp/graph9313860701711450575.bin' '-w' '/tmp/graph9313860701711450575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9313860701711450575.bin' '-l' '-1' '-v' '-w' '/tmp/graph9313860701711450575.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:31:25] [INFO ] Decomposing Gal with order
[2024-05-22 12:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:31:25] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-22 12:31:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 1 ms.
[2024-05-22 12:31:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16239256029129585923.gal : 1 ms
[2024-05-22 12:31:25] [INFO ] Time to serialize properties into /tmp/CTLFireability765791846198964808.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16239256029129585923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability765791846198964808.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 260 transition count 306
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 260 transition count 306
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 248 transition count 294
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 248 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 117 place count 237 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 128 place count 237 transition count 283
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 138 place count 227 transition count 271
Iterating global reduction 0 with 10 rules applied. Total rules applied 148 place count 227 transition count 271
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 158 place count 217 transition count 253
Iterating global reduction 0 with 10 rules applied. Total rules applied 168 place count 217 transition count 253
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 177 place count 208 transition count 244
Iterating global reduction 0 with 9 rules applied. Total rules applied 186 place count 208 transition count 244
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 193 place count 201 transition count 237
Iterating global reduction 0 with 7 rules applied. Total rules applied 200 place count 201 transition count 237
Applied a total of 200 rules in 21 ms. Remains 201 /301 variables (removed 100) and now considering 237/347 (removed 110) transitions.
// Phase 1: matrix 237 rows 201 cols
[2024-05-22 12:31:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:31:55] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 12:31:55] [INFO ] Invariant cache hit.
[2024-05-22 12:31:55] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-22 12:31:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 237/438 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 12:31:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:32:00] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:32:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 17/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 220 constraints, problems are : Problem set: 0 solved, 236 unsolved in 9817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/438 variables, 201/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 236/456 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 456 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10939 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 17/17 constraints]
After SMT, in 20835ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 20837ms
Starting structural reductions in LTL mode, iteration 1 : 201/301 places, 237/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21050 ms. Remains : 201/301 places, 237/347 transitions.
[2024-05-22 12:32:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:32:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:32:16] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-22 12:32:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:32:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:32:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8126973778733734430.gal : 1 ms
[2024-05-22 12:32:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3226974721690580351.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8126973778733734430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3226974721690580351.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:32:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:32:46] [INFO ] Applying decomposition
[2024-05-22 12:32:46] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph1102834005830527288.txt' '-o' '/tmp/graph1102834005830527288.bin' '-w' '/tmp/graph1102834005830527288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1102834005830527288.bin' '-l' '-1' '-v' '-w' '/tmp/graph1102834005830527288.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:32:46] [INFO ] Decomposing Gal with order
[2024-05-22 12:32:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:32:46] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 12:32:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2024-05-22 12:32:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10425143108653236848.gal : 2 ms
[2024-05-22 12:32:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2954376676953107369.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10425143108653236848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2954376676953107369.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 262 transition count 308
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 262 transition count 308
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 250 transition count 296
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 250 transition count 296
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 241 transition count 287
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 241 transition count 287
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 234 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 234 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 228 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 228 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 152 place count 222 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 158 place count 222 transition count 262
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 163 place count 217 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 168 place count 217 transition count 257
Applied a total of 168 rules in 12 ms. Remains 217 /301 variables (removed 84) and now considering 257/347 (removed 90) transitions.
// Phase 1: matrix 257 rows 217 cols
[2024-05-22 12:33:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:33:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 12:33:16] [INFO ] Invariant cache hit.
[2024-05-22 12:33:16] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-22 12:33:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/474 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 3 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:33:21] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 12:33:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:33:22] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:33:22] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 12:33:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-22 12:33:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-22 12:33:22] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 242 constraints, problems are : Problem set: 0 solved, 256 unsolved in 11907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/474 variables, 217/242 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 256/498 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 498 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 23/23 constraints]
After SMT, in 24495ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 24497ms
Starting structural reductions in LTL mode, iteration 1 : 217/301 places, 257/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24705 ms. Remains : 217/301 places, 257/347 transitions.
[2024-05-22 12:33:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:33:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:33:41] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-22 12:33:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:33:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:33:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17314697246404254175.gal : 2 ms
[2024-05-22 12:33:41] [INFO ] Time to serialize properties into /tmp/CTLFireability10276069575574088493.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17314697246404254175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10276069575574088493.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:34:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:34:11] [INFO ] Applying decomposition
[2024-05-22 12:34:11] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14356167939670850594.txt' '-o' '/tmp/graph14356167939670850594.bin' '-w' '/tmp/graph14356167939670850594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14356167939670850594.bin' '-l' '-1' '-v' '-w' '/tmp/graph14356167939670850594.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:34:11] [INFO ] Decomposing Gal with order
[2024-05-22 12:34:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:34:11] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-22 12:34:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:34:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2024-05-22 12:34:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2411998036505560555.gal : 2 ms
[2024-05-22 12:34:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12902919657987593667.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2411998036505560555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12902919657987593667.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 347/347 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 259 transition count 305
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 259 transition count 305
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 96 place count 247 transition count 293
Iterating global reduction 0 with 12 rules applied. Total rules applied 108 place count 247 transition count 293
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 236 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 236 transition count 282
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 141 place count 225 transition count 268
Iterating global reduction 0 with 11 rules applied. Total rules applied 152 place count 225 transition count 268
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 163 place count 214 transition count 249
Iterating global reduction 0 with 11 rules applied. Total rules applied 174 place count 214 transition count 249
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 185 place count 203 transition count 238
Iterating global reduction 0 with 11 rules applied. Total rules applied 196 place count 203 transition count 238
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 204 place count 195 transition count 230
Iterating global reduction 0 with 8 rules applied. Total rules applied 212 place count 195 transition count 230
Applied a total of 212 rules in 20 ms. Remains 195 /301 variables (removed 106) and now considering 230/347 (removed 117) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-22 12:34:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:34:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 12:34:41] [INFO ] Invariant cache hit.
[2024-05-22 12:34:41] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-22 12:34:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:34:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 12:34:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 218 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 447 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
After SMT, in 20476ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 20478ms
Starting structural reductions in LTL mode, iteration 1 : 195/301 places, 230/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20694 ms. Remains : 195/301 places, 230/347 transitions.
[2024-05-22 12:35:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:35:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:35:02] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-22 12:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9418735902829597588.gal : 1 ms
[2024-05-22 12:35:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9170792560789021545.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9418735902829597588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9170792560789021545.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:35:32] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:35:32] [INFO ] Applying decomposition
[2024-05-22 12:35:32] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12160963754068318706.txt' '-o' '/tmp/graph12160963754068318706.bin' '-w' '/tmp/graph12160963754068318706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12160963754068318706.bin' '-l' '-1' '-v' '-w' '/tmp/graph12160963754068318706.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:35:32] [INFO ] Decomposing Gal with order
[2024-05-22 12:35:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:35:32] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-22 12:35:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:35:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2024-05-22 12:35:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17522594359517785358.gal : 2 ms
[2024-05-22 12:35:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10674645088932202905.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17522594359517785358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10674645088932202905.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 12:36:02] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:36:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:36:02] [INFO ] Applying decomposition
[2024-05-22 12:36:02] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph10902640056900727212.txt' '-o' '/tmp/graph10902640056900727212.bin' '-w' '/tmp/graph10902640056900727212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10902640056900727212.bin' '-l' '-1' '-v' '-w' '/tmp/graph10902640056900727212.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:36:02] [INFO ] Decomposing Gal with order
[2024-05-22 12:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:36:02] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-22 12:36:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 12:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7523467918431173442.gal : 3 ms
[2024-05-22 12:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16243219100103410716.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7523467918431173442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16243219100103410716.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 15 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.26513e+17,292.344,4679524,17283,186,8.41e+06,25982,682,3.72021e+07,62,313513,0
Converting to forward existential form...Done !
ITS-tools command line returned an error code 139
[2024-05-22 12:46:02] [INFO ] Applying decomposition
[2024-05-22 12:46:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:46:02] [INFO ] Decomposing Gal with order
[2024-05-22 12:46:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:46:02] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 12:46:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 775 labels/synchronizations in 10 ms.
[2024-05-22 12:46:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3996769339913931626.gal : 2 ms
[2024-05-22 12:46:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16650820528427254583.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3996769339913931626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16650820528427254583.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 15 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.26513e+17,405.946,7663436,1357,2859,1.07902e+07,2.50043e+06,446,3.73481e+07,266,2.29742e+07,0
Converting to forward existential form...Done !
original formula: AX(AF((((((i0.i0.i0.i0.i0.u19.p211==1)&&(i1.u26.p350==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p25==1)&&(i1.u25.p343==1)))||((i0.i0.i0...365
=> equivalent forward existential formula: [FwdG(EY(Init),!((((((i0.i0.i0.i0.i0.u19.p211==1)&&(i1.u26.p350==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p25...410
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 2
Detected timeout of ITS tools.
[2024-05-22 13:13:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:13:14] [INFO ] Input system was already deterministic with 347 transitions.
[2024-05-22 13:13:14] [INFO ] Transformed 301 places.
[2024-05-22 13:13:14] [INFO ] Transformed 347 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 13:13:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3212779429184300861.gal : 2 ms
[2024-05-22 13:13:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1920231919925684903.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3212779429184300861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1920231919925684903.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-12b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-12b, 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 r136-tall-171631132700466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;