About the Execution of ITS-Tools for DiscoveryGPU-PT-12a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 443684.00 | 0.00 | 0.00 | FTFFTFTTTTFTTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700706.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DiscoveryGPU-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700706
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-15
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-00
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-01
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-02
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-03
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-04
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-05
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-06
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-07
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-08
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-09
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-10
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748936678737
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-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 07:44:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 07:44:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:44:41] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-03 07:44:41] [INFO ] Transformed 123 places.
[2025-06-03 07:44:41] [INFO ] Transformed 169 transitions.
[2025-06-03 07:44:41] [INFO ] Found NUPN structural information;
[2025-06-03 07:44:41] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 64 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 115 transition count 161
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 115 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 30 place count 114 transition count 148
Applied a total of 30 rules in 46 ms. Remains 114 /123 variables (removed 9) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 114 cols
[2025-06-03 07:44:41] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:44:41] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-03 07:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:44:41] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-03 07:44:41] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-03 07:44:41] [INFO ] Invariant cache hit.
[2025-06-03 07:44:41] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/262 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 95/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 211 constraints, problems are : Problem set: 0 solved, 147 unsolved in 8195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/262 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 95/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 147/358 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 358 constraints, problems are : Problem set: 0 solved, 147 unsolved in 7442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15737ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 15759ms
Starting structural reductions in LTL mode, iteration 1 : 114/123 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16528 ms. Remains : 114/123 places, 148/169 transitions.
Support contains 64 out of 114 places after structural reductions.
[2025-06-03 07:44:57] [INFO ] Flatten gal took : 52 ms
[2025-06-03 07:44:58] [INFO ] Flatten gal took : 28 ms
[2025-06-03 07:44:58] [INFO ] Input system was already deterministic with 148 transitions.
Reduction of identical properties reduced properties to check from 61 to 60
RANDOM walk for 33911 steps (263 resets) in 1151 ms. (29 steps per ms) remains 0/60 properties
[2025-06-03 07:44:58] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:44:58] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:44:58] [INFO ] Input system was already deterministic with 148 transitions.
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 104 transition count 138
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 104 transition count 138
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 95 transition count 129
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 92 transition count 126
Applied a total of 44 rules in 19 ms. Remains 92 /114 variables (removed 22) and now considering 126/148 (removed 22) transitions.
// Phase 1: matrix 126 rows 92 cols
[2025-06-03 07:44:58] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:44:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-03 07:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:44:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:44:58] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 308 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/114 places, 126/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 91/114 places, 126/148 transitions.
[2025-06-03 07:44:58] [INFO ] Flatten gal took : 14 ms
[2025-06-03 07:44:59] [INFO ] Flatten gal took : 10 ms
[2025-06-03 07:44:59] [INFO ] Input system was already deterministic with 126 transitions.
[2025-06-03 07:44:59] [INFO ] Flatten gal took : 13 ms
[2025-06-03 07:44:59] [INFO ] Flatten gal took : 9 ms
[2025-06-03 07:44:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13554327673781890611.gal : 4 ms
[2025-06-03 07:44:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11244785955577598301.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13554327673781890611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11244785955577598301.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 07:45:29] [INFO ] Flatten gal took : 9 ms
[2025-06-03 07:45:29] [INFO ] Applying decomposition
[2025-06-03 07:45:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15132184591411903808.txt' '-o' '/tmp/graph15132184591411903808.bin' '-w' '/tmp/graph15132184591411903808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15132184591411903808.bin' '-l' '-1' '-v' '-w' '/tmp/graph15132184591411903808.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:45:29] [INFO ] Decomposing Gal with order
[2025-06-03 07:45:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:45:29] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 07:45:29] [INFO ] Flatten gal took : 74 ms
[2025-06-03 07:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 14 ms.
[2025-06-03 07:45:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1356248651261458400.gal : 6 ms
[2025-06-03 07:45:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7304768744645549843.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1356248651261458400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7304768744645549843.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.2897e+11,0.250237,11732,548,73,17477,1890,201,33568,41,9870,0
Converting to forward existential form...Done !
original formula: EX(EF(((i11.u22.p102==1)&&(i2.u0.p121==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((i11.u22.p102==1)&&(i2.u0.p121==1)))] != FALSE
(forward)formula 0,1,0.403426,11988,1,0,18031,1890,458,34105,87,10066,20122
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 120 edges and 107 vertex of which 84 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Graph (trivial) has 94 edges and 84 vertex of which 46 / 84 are part of one of the 23 SCC in 2 ms
Free SCC test removed 23 places
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 0 with 16 rules applied. Total rules applied 17 place count 61 transition count 108
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 52 place count 49 transition count 85
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 39 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 39 transition count 65
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 29 transition count 45
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 29 transition count 45
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 102 place count 19 transition count 25
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 19 transition count 25
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 9 transition count 15
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 6 transition count 11
Applied a total of 137 rules in 35 ms. Remains 6 /114 variables (removed 108) and now considering 11/148 (removed 137) transitions.
[2025-06-03 07:45:29] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 07:45:29] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-03 07:45:29] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 07:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:45:29] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 07:45:29] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 07:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 129 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 114 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/114 places, 11/148 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 341 ms. Remains : 6/114 places, 11/148 transitions.
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:45:30] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 297 steps (7 resets) in 5 ms. (49 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 0 ms
[2025-06-03 07:45:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14599986976930111215.gal : 0 ms
[2025-06-03 07:45:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18397277166015821933.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14599986976930111215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18397277166015821933.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 110 transition count 134
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 100 transition count 134
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 31 place count 90 transition count 124
Iterating global reduction 0 with 10 rules applied. Total rules applied 41 place count 90 transition count 124
Applied a total of 41 rules in 26 ms. Remains 90 /114 variables (removed 24) and now considering 124/148 (removed 24) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:45:30] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 07:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:30] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:45:30] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 308 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/114 places, 124/148 transitions.
Applied a total of 0 rules in 9 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 343 ms. Remains : 89/114 places, 124/148 transitions.
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 7 ms
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:45:30] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 7 ms
[2025-06-03 07:45:30] [INFO ] Flatten gal took : 7 ms
[2025-06-03 07:45:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5879334211662196290.gal : 3 ms
[2025-06-03 07:45:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3673089308365905980.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5879334211662196290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3673089308365905980.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04011e+11,1.50627,45532,2,13661,5,284209,6,0,468,121045,0
Converting to forward existential form...Done !
original formula: EF(AG(((p72==0)||(p121==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p72==0)||(p121==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t33, t35, t37, t39, t40, t42, t44, t46, t48, t101, t111, t112, t113, t114, t115, t1...300
(forward)formula 0,1,12.1934,275628,1,0,172,1.42249e+06,270,116,2725,1.31632e+06,258
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 110 transition count 134
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 100 transition count 134
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 32 place count 89 transition count 123
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 89 transition count 123
Applied a total of 43 rules in 17 ms. Remains 89 /114 variables (removed 25) and now considering 123/148 (removed 25) transitions.
// Phase 1: matrix 123 rows 89 cols
[2025-06-03 07:45:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-03 07:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:43] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:45:43] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/114 places, 123/148 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 123
Applied a total of 1 rules in 15 ms. Remains 88 /88 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 88 cols
[2025-06-03 07:45:43] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 07:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:45:43] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-03 07:45:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 88/114 places, 123/148 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 568 ms. Remains : 88/114 places, 123/148 transitions.
[2025-06-03 07:45:43] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:45:43] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:45:43] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-03 07:45:43] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:45:43] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:45:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2102297126369507314.gal : 2 ms
[2025-06-03 07:45:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8380258753673613874.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2102297126369507314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8380258753673613874.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.922e+11,2.00452,52852,2,16532,5,341555,6,0,463,169774,0
Converting to forward existential form...Done !
original formula: AF(AG((((p116==0)||(p121==0)) + (EF((p94==0)) + ((p53==0)&&((p70==0)||(p121==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p116==0)||(p121==0)) + (E(TRUE U (p94==0)) + ((p53==0)&&((p70==0)||(p121==0))))))))...166
Reverse transition relation is NOT exact ! Due to transitions t13, t26, t28, t30, t34, t36, t38, t39, t41, t43, t45, t47, t109, t110, t111, t112, t113, t11...299
(forward)formula 0,1,17.5069,347960,1,0,177,1.82737e+06,274,116,2767,1.91019e+06,261
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 104 transition count 138
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 104 transition count 138
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 96 transition count 130
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 96 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 94 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 94 transition count 128
Applied a total of 40 rules in 7 ms. Remains 94 /114 variables (removed 20) and now considering 128/148 (removed 20) transitions.
// Phase 1: matrix 128 rows 94 cols
[2025-06-03 07:46:01] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:46:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-03 07:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:46:01] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-03 07:46:01] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2025-06-03 07:46:01] [INFO ] Invariant cache hit.
[2025-06-03 07:46:01] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 87/183 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/222 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 183 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5620 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 87/183 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 127/310 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 310 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11280ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 11281ms
Starting structural reductions in LTL mode, iteration 1 : 94/114 places, 128/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11537 ms. Remains : 94/114 places, 128/148 transitions.
[2025-06-03 07:46:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:46:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:46:12] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-03 07:46:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:46:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:46:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1011944810606942964.gal : 2 ms
[2025-06-03 07:46:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7974763652987979590.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1011944810606942964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7974763652987979590.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.51947e+11,2.74238,66824,2,9732,5,400172,6,0,489,217716,0
Converting to forward existential form...Done !
original formula: E(AF(!((((p54==1)&&(p122==1)) * AX(AF(((p49==1)&&(p121==1))))))) U ((AF(((!(AG(((p45==1)&&(p121==1)))) + (p58==1)) + (AG(((p44==1)&&(p122...345
=> equivalent forward existential formula: [(((EY((FwdU(Init,!(EG(!(!((((p54==1)&&(p122==1)) * !(EX(!(!(EG(!(((p49==1)&&(p121==1)))))))))))))) * (!(EG(!(((...487
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t41, t42, t44, t46, t48, t50, t105, t107, t109, t115, t116, t117, t118, t...308
Detected timeout of ITS tools.
[2025-06-03 07:46:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:46:42] [INFO ] Applying decomposition
[2025-06-03 07:46:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16219590974626686765.txt' '-o' '/tmp/graph16219590974626686765.bin' '-w' '/tmp/graph16219590974626686765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16219590974626686765.bin' '-l' '-1' '-v' '-w' '/tmp/graph16219590974626686765.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:46:42] [INFO ] Decomposing Gal with order
[2025-06-03 07:46:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:46:42] [INFO ] Removed a total of 83 redundant transitions.
[2025-06-03 07:46:42] [INFO ] Flatten gal took : 15 ms
[2025-06-03 07:46:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 14 ms.
[2025-06-03 07:46:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5726961103606744846.gal : 4 ms
[2025-06-03 07:46:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6536008669243138362.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5726961103606744846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6536008669243138362.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.51947e+11,0.144119,8080,338,74,8234,583,261,19410,31,3204,0
Converting to forward existential form...Done !
original formula: E(AF(!((((i5.u19.p54==1)&&(i6.u1.p122==1)) * AX(AF(((i4.u18.p49==1)&&(i4.u0.p121==1))))))) U ((AF(((!(AG(((i4.u16.p45==1)&&(i4.u0.p121==1...498
=> equivalent forward existential formula: [(((EY((FwdU(Init,!(EG(!(!((((i5.u19.p54==1)&&(i6.u1.p122==1)) * !(EX(!(!(EG(!(((i4.u18.p49==1)&&(i4.u0.p121==1)...660
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t41, t42, t44, t48, t50, t105, t107, t109, i0.u3.t121, i1.u7.t120, i2.u10...403
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,3.97956,105232,1,0,151582,3505,1716,611822,171,47368,121745
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 110 transition count 135
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 101 transition count 135
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 29 place count 91 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 39 place count 91 transition count 125
Applied a total of 39 rules in 16 ms. Remains 91 /114 variables (removed 23) and now considering 125/148 (removed 23) transitions.
// Phase 1: matrix 125 rows 91 cols
[2025-06-03 07:46:47] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:46:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-03 07:46:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:46:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:46:47] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:46:47] [INFO ] Redundant transitions in 4 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-03 07:46:47] [INFO ] Invariant cache hit.
[2025-06-03 07:46:47] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 86/179 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 179 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 86/179 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 124/303 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 303 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10447ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 10448ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/114 places, 125/148 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10710 ms. Remains : 91/114 places, 125/148 transitions.
[2025-06-03 07:46:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:46:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:46:57] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-03 07:46:57] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:46:57] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:46:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14767398731066114652.gal : 2 ms
[2025-06-03 07:46:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5406743075621404659.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14767398731066114652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5406743075621404659.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2817e+11,1.57256,41004,2,5813,5,246839,6,0,475,120431,0
Converting to forward existential form...Done !
original formula: A(EG((AG(AF((p58==1))) * !((((E(((p22==1)&&(p121==1)) U ((p57==1)&&(p121==1))) * !(((p86==1)&&(p121==1)))) * ((p119==1)&&(p121==1))) * ((...207
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p15==1)&&(p121==1))))))) * !(E(!(E(TRUE U ((p15==1)&&(p121==1)))) U (!(EG((!(E(TRUE ...370
Reverse transition relation is NOT exact ! Due to transitions t9, t28, t30, t34, t36, t38, t40, t43, t45, t47, t49, t106, t112, t113, t114, t115, t116, t11...300
Detected timeout of ITS tools.
[2025-06-03 07:47:27] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:47:27] [INFO ] Applying decomposition
[2025-06-03 07:47:27] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16965996545632322726.txt' '-o' '/tmp/graph16965996545632322726.bin' '-w' '/tmp/graph16965996545632322726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16965996545632322726.bin' '-l' '-1' '-v' '-w' '/tmp/graph16965996545632322726.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:47:27] [INFO ] Decomposing Gal with order
[2025-06-03 07:47:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:47:27] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-03 07:47:27] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:47:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 6 ms.
[2025-06-03 07:47:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9611847029480449304.gal : 15 ms
[2025-06-03 07:47:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1863699396059394142.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9611847029480449304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1863699396059394142.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2817e+11,0.072771,5928,221,105,3595,452,226,8489,36,3245,0
Converting to forward existential form...Done !
original formula: A(EG((AG(AF((i6.u17.p58==1))) * !((((E(((i3.u5.p22==1)&&(i0.u0.p121==1)) U ((i6.u16.p57==1)&&(i0.u0.p121==1))) * !(((i9.u25.p86==1)&&(i0....292
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i1.u2.p15==1)&&(i0.u0.p121==1))))))) * !(E(!(E(TRUE U ((i1.u2.p15==1)&&(i0.u0.p121==...479
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t34, t36, t40, t43, t45, t47, t49, t86, t106, i0.u0.t118, i1.t38, i1.u3.t117, i1.u3...391
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,1.49903,46504,1,0,84244,2892,1404,168916,179,26475,71797
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 104 transition count 138
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 104 transition count 138
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 95 transition count 129
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 95 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 93 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 93 transition count 127
Applied a total of 42 rules in 8 ms. Remains 93 /114 variables (removed 21) and now considering 127/148 (removed 21) transitions.
// Phase 1: matrix 127 rows 93 cols
[2025-06-03 07:47:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:47:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 07:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:47:29] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:47:29] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-03 07:47:29] [INFO ] Invariant cache hit.
[2025-06-03 07:47:29] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/220 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 86/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 181 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/220 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 86/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 126/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 307 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11137ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 11138ms
Starting structural reductions in LTL mode, iteration 1 : 93/114 places, 127/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11492 ms. Remains : 93/114 places, 127/148 transitions.
[2025-06-03 07:47:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:47:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:47:40] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-03 07:47:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:47:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:47:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18362872755086478992.gal : 1 ms
[2025-06-03 07:47:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10588628598892869289.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18362872755086478992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10588628598892869289.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.97841e+11,3.50417,81456,2,10685,5,530849,6,0,484,272830,0
Converting to forward existential form...Done !
original formula: AG(EX(((((p83==0)||(p122==0)) + (AF(((p63==0)||(p122==0))) + (p48==0))) + !(E(((p82==1)&&(p121==1)) U ((p34==1)&&(p122==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((p83==0)||(p122==0)) + (!(EG(!(((p63==0)||(p122==0))))) + (p48==0))) + !(E(((p82==1)...206
Reverse transition relation is NOT exact ! Due to transitions t12, t25, t29, t31, t33, t35, t37, t39, t41, t42, t44, t50, t107, t111, t114, t115, t116, t11...312
(forward)formula 0,0,17.6573,362652,1,0,400,1.87725e+06,284,216,2900,2.59876e+06,523
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 111 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 121 edges and 108 vertex of which 87 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Graph (trivial) has 98 edges and 87 vertex of which 48 / 87 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 63 transition count 110
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 55 place count 50 transition count 86
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 65 place count 40 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 40 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 30 transition count 46
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 30 transition count 46
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 105 place count 20 transition count 26
Iterating global reduction 2 with 10 rules applied. Total rules applied 115 place count 20 transition count 26
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 125 place count 10 transition count 16
Iterating global reduction 2 with 10 rules applied. Total rules applied 135 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 10 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 7 transition count 12
Applied a total of 140 rules in 12 ms. Remains 7 /114 variables (removed 107) and now considering 12/148 (removed 136) transitions.
[2025-06-03 07:47:58] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 07:47:58] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:47:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 07:47:58] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 07:47:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:47:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:47:58] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 07:47:58] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 07:47:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 120 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 127 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 251ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/114 places, 12/148 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 309 ms. Remains : 7/114 places, 12/148 transitions.
[2025-06-03 07:47:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:47:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:47:59] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 07:47:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:47:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12168328704856744231.gal : 0 ms
[2025-06-03 07:47:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality381391916041730210.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12168328704856744231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality381391916041730210.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 343 steps (9 resets) in 5 ms. (57 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 110 transition count 134
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 100 transition count 134
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 32 place count 89 transition count 123
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 89 transition count 123
Applied a total of 43 rules in 14 ms. Remains 89 /114 variables (removed 25) and now considering 123/148 (removed 25) transitions.
// Phase 1: matrix 123 rows 89 cols
[2025-06-03 07:47:59] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:47:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 07:47:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:47:59] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:47:59] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:47:59] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-03 07:47:59] [INFO ] Invariant cache hit.
[2025-06-03 07:47:59] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 176 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 122/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 298 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10529ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/114 places, 123/148 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10779 ms. Remains : 89/114 places, 123/148 transitions.
[2025-06-03 07:48:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:48:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:48:09] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-03 07:48:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:48:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:48:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16423115320714678373.gal : 1 ms
[2025-06-03 07:48:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13882669554213067779.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16423115320714678373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13882669554213067779.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.922e+11,1.19847,31936,2,5615,5,170159,6,0,465,95393,0
Converting to forward existential form...Done !
original formula: E(!(((p53==1)&&(p122==1))) U (EG(EF(((p24==1)&&(p122==1)))) * !(EF(((((p84==1)&&(p14==1))&&((p122==1)&&((p56==1)||((p116==1)&&(p121==1)))...213
=> equivalent forward existential formula: [((FwdU(Init,!(((p53==1)&&(p122==1)))) * EG(E(TRUE U ((p24==1)&&(p122==1))))) * !(E(TRUE U ((((p84==1)&&(p14==1)...340
Reverse transition relation is NOT exact ! Due to transitions t13, t27, t29, t31, t35, t37, t39, t40, t42, t44, t46, t48, t110, t111, t112, t113, t114, t11...299
Detected timeout of ITS tools.
[2025-06-03 07:48:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:48:39] [INFO ] Applying decomposition
[2025-06-03 07:48:39] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph12259452491314682871.txt' '-o' '/tmp/graph12259452491314682871.bin' '-w' '/tmp/graph12259452491314682871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12259452491314682871.bin' '-l' '-1' '-v' '-w' '/tmp/graph12259452491314682871.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:48:39] [INFO ] Decomposing Gal with order
[2025-06-03 07:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:48:39] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-03 07:48:39] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 5 ms.
[2025-06-03 07:48:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6229655435849102838.gal : 3 ms
[2025-06-03 07:48:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7936307530086797903.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6229655435849102838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7936307530086797903.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.922e+11,0.107516,7396,226,112,6059,665,221,17182,36,6181,0
Converting to forward existential form...Done !
original formula: E(!(((i6.u35.p53==1)&&(i6.u35.p122==1))) U (EG(EF(((i2.u5.p24==1)&&(i6.u35.p122==1)))) * !(EF(((((i9.u23.p84==1)&&(i1.u2.p14==1))&&((i6.u...308
=> equivalent forward existential formula: [((FwdU(Init,!(((i6.u35.p53==1)&&(i6.u35.p122==1)))) * EG(E(TRUE U ((i2.u5.p24==1)&&(i6.u35.p122==1))))) * !(E(T...459
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t35, t37, t39, t40, t42, t46, t48, t92, i0.u0.t116, i1.u3.t115, i2.u6.t117, i3...390
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,1.3445,40164,1,0,69342,2970,1427,159120,173,16596,61943
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 104 transition count 138
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 104 transition count 138
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 96 transition count 130
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 96 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 94 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 94 transition count 128
Applied a total of 40 rules in 6 ms. Remains 94 /114 variables (removed 20) and now considering 128/148 (removed 20) transitions.
// Phase 1: matrix 128 rows 94 cols
[2025-06-03 07:48:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:48:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-03 07:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:48:41] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:48:41] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2025-06-03 07:48:41] [INFO ] Invariant cache hit.
[2025-06-03 07:48:41] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 86/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/222 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 182 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 86/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 127/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 309 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10781ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 10782ms
Starting structural reductions in LTL mode, iteration 1 : 94/114 places, 128/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11020 ms. Remains : 94/114 places, 128/148 transitions.
[2025-06-03 07:48:52] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:48:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:48:52] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-03 07:48:52] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:48:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability504451444354242227.gal : 1 ms
[2025-06-03 07:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12110736404134514408.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability504451444354242227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12110736404134514408.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.69808e+11,7.25486,156948,2,28141,5,1.00264e+06,6,0,489,563962,0
Converting to forward existential form...Done !
original formula: EF((E(E((!(((p108==1)&&(p122==1))) * EG(((p100==1)&&(p121==1)))) U EG((p46==1))) U AG(EX(((p99==1)&&(p121==1))))) * ((EF((p16==0)) + EX((...296
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * E(E((!(((p108==1)&&(p122==1))) * EG(((p100==1)&&(p121==1)))) U EG((p46==1))) U !(E(T...845
Reverse transition relation is NOT exact ! Due to transitions t10, t13, t26, t30, t36, t38, t40, t42, t43, t45, t49, t51, t103, t109, t115, t116, t117, t11...312
Detected timeout of ITS tools.
[2025-06-03 07:49:22] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:49:22] [INFO ] Applying decomposition
[2025-06-03 07:49:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17013498503823138552.txt' '-o' '/tmp/graph17013498503823138552.bin' '-w' '/tmp/graph17013498503823138552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17013498503823138552.bin' '-l' '-1' '-v' '-w' '/tmp/graph17013498503823138552.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:49:22] [INFO ] Decomposing Gal with order
[2025-06-03 07:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:49:22] [INFO ] Removed a total of 82 redundant transitions.
[2025-06-03 07:49:22] [INFO ] Flatten gal took : 10 ms
[2025-06-03 07:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 9 ms.
[2025-06-03 07:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8413765465859024166.gal : 3 ms
[2025-06-03 07:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability18151465167997467056.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8413765465859024166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18151465167997467056.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.69808e+11,0.37947,14540,726,145,20602,2330,242,49108,32,14094,0
Converting to forward existential form...Done !
original formula: EF((E(E((!(((i11.u36.p108==1)&&(i0.u2.p122==1))) * EG(((i10.u33.p100==1)&&(i2.u0.p121==1)))) U EG((i5.u16.p46==1))) U AG(EX(((i10.u33.p99...424
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * E(E((!(((i11.u36.p108==1)&&(i0.u2.p122==1))) * EG(((i10.u33.p100==1)&&(i2.u0.p121==1...1120
Reverse transition relation is NOT exact ! Due to transitions t30, t36, t38, t40, t42, t43, t45, t49, t51, t103, t109, i0.t26, i0.u1.t10, i0.u1.t13, i1.u4....416
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,2.33151,58316,1,0,99620,5345,1367,239265,166,39654,98774
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 109 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 109 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 105 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 105 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 104 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 104 transition count 138
Applied a total of 20 rules in 5 ms. Remains 104 /114 variables (removed 10) and now considering 138/148 (removed 10) transitions.
// Phase 1: matrix 138 rows 104 cols
[2025-06-03 07:49:24] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:49:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-03 07:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:49:25] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-03 07:49:25] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2025-06-03 07:49:25] [INFO ] Invariant cache hit.
[2025-06-03 07:49:25] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/242 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 90/196 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 196 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/242 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 90/196 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 137/333 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 333 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12370ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12371ms
Starting structural reductions in LTL mode, iteration 1 : 104/114 places, 138/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12725 ms. Remains : 104/114 places, 138/148 transitions.
[2025-06-03 07:49:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:49:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:49:37] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-03 07:49:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:49:37] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:49:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5838593704615051549.gal : 1 ms
[2025-06-03 07:49:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12141960227587082435.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5838593704615051549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12141960227587082435.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64093e+12,4.50713,102704,2,13130,5,621376,6,0,537,360101,0
Converting to forward existential form...Done !
original formula: (E(((AX(((p52==1)&&(p121==1))) + !(AX(((p38==1)||(p61==1))))) + AF(!(AG((p23==1))))) U (((p57==1)&&(p121==1)) + AG(E(AF((p16==1)) U EF(((...504
=> equivalent forward existential formula: ([(Init * !(E(((!(EX(!(((p52==1)&&(p121==1))))) + !(!(EX(!(((p38==1)||(p61==1))))))) + !(EG(!(!(!(E(TRUE U !((p2...802
Reverse transition relation is NOT exact ! Due to transitions t1, t24, t30, t38, t42, t46, t49, t53, t107, t110, t115, t121, t123, t124, t125, t126, t127, ...315
Detected timeout of ITS tools.
[2025-06-03 07:50:07] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:50:07] [INFO ] Applying decomposition
[2025-06-03 07:50:07] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2040206180107069997.txt' '-o' '/tmp/graph2040206180107069997.bin' '-w' '/tmp/graph2040206180107069997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2040206180107069997.bin' '-l' '-1' '-v' '-w' '/tmp/graph2040206180107069997.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:50:07] [INFO ] Decomposing Gal with order
[2025-06-03 07:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:50:07] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-03 07:50:07] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:50:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 8 ms.
[2025-06-03 07:50:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15062537687615758938.gal : 5 ms
[2025-06-03 07:50:07] [INFO ] Time to serialize properties into /tmp/CTLFireability847683328170037435.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15062537687615758938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability847683328170037435.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64093e+12,0.342074,13636,512,101,20255,1001,281,38403,34,6429,0
Converting to forward existential form...Done !
original formula: (E(((AX(((i6.u19.p52==1)&&(i4.u0.p121==1))) + !(AX(((i4.u15.p38==1)||(i7.i0.u23.p61==1))))) + AF(!(AG((i0.u1.p23==1))))) U (((i6.u21.p57=...726
=> equivalent forward existential formula: ([(Init * !(E(((!(EX(!(((i6.u19.p52==1)&&(i4.u0.p121==1))))) + !(!(EX(!(((i4.u15.p38==1)||(i7.i0.u23.p61==1)))))...1071
Reverse transition relation is NOT exact ! Due to transitions t38, t42, t46, t49, t53, t107, t110, t115, t121, i0.t30, i0.u1.t1, i0.u1.t24, i1.u4.t130, i2....439
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,9.89315,177604,1,0,368930,2134,1712,473277,177,18634,230317
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Graph (complete) has 330 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 110 transition count 134
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 100 transition count 134
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 32 place count 89 transition count 123
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 89 transition count 123
Applied a total of 43 rules in 11 ms. Remains 89 /114 variables (removed 25) and now considering 123/148 (removed 25) transitions.
// Phase 1: matrix 123 rows 89 cols
[2025-06-03 07:50:17] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:50:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-03 07:50:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:50:17] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:50:17] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:50:17] [INFO ] Redundant transitions in 4 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-03 07:50:17] [INFO ] Invariant cache hit.
[2025-06-03 07:50:17] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 176 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 122/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 298 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10600ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10601ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/114 places, 123/148 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10875 ms. Remains : 89/114 places, 123/148 transitions.
[2025-06-03 07:50:28] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:50:28] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:50:28] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-03 07:50:28] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 1210 steps (7 resets) in 9 ms. (121 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 07:50:28] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:50:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17550880777760111696.gal : 1 ms
[2025-06-03 07:50:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16868006833611035436.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17550880777760111696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16868006833611035436.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 105 transition count 139
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 105 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 97 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 97 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 95 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 95 transition count 129
Applied a total of 38 rules in 4 ms. Remains 95 /114 variables (removed 19) and now considering 129/148 (removed 19) transitions.
// Phase 1: matrix 129 rows 95 cols
[2025-06-03 07:50:28] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:50:28] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 07:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:50:28] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:50:28] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-03 07:50:28] [INFO ] Invariant cache hit.
[2025-06-03 07:50:28] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 86/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 183 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 86/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 311 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10513ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10513ms
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 129/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10741 ms. Remains : 95/114 places, 129/148 transitions.
[2025-06-03 07:50:39] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:50:39] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:50:39] [INFO ] Input system was already deterministic with 129 transitions.
[2025-06-03 07:50:39] [INFO ] Flatten gal took : 7 ms
[2025-06-03 07:50:39] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:50:39] [INFO ] Time to serialize gal into /tmp/CTLFireability4029447956481329892.gal : 1 ms
[2025-06-03 07:50:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3995782085611936495.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4029447956481329892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3995782085611936495.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.05549e+11,2.13297,55284,2,7096,5,350977,6,0,493,182256,0
Converting to forward existential form...Done !
original formula: EG(AF(((A(AG((p76==1)) U ((p58==1)&&(p3==1))) * (((p11==1) + EX(((p66==1)&&(p121==1)))) + EX(((p15==1)&&(p121==1))))) * ((p73==1) + AG(((...204
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(((p58==1)&&(p3==1))) U (!(!(E(TRUE U !((p76==1))))) * !(((p58==1)&&(p3==1))))) + EG(!...344
Reverse transition relation is NOT exact ! Due to transitions t9, t20, t26, t30, t32, t36, t38, t43, t45, t47, t49, t51, t115, t116, t117, t118, t119, t120...305
Detected timeout of ITS tools.
[2025-06-03 07:51:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:51:09] [INFO ] Applying decomposition
[2025-06-03 07:51:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8690728887072427344.txt' '-o' '/tmp/graph8690728887072427344.bin' '-w' '/tmp/graph8690728887072427344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8690728887072427344.bin' '-l' '-1' '-v' '-w' '/tmp/graph8690728887072427344.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:51:09] [INFO ] Decomposing Gal with order
[2025-06-03 07:51:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:51:09] [INFO ] Removed a total of 80 redundant transitions.
[2025-06-03 07:51:09] [INFO ] Flatten gal took : 10 ms
[2025-06-03 07:51:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 4 ms.
[2025-06-03 07:51:09] [INFO ] Time to serialize gal into /tmp/CTLFireability90363772283448713.gal : 2 ms
[2025-06-03 07:51:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18300745381176196372.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability90363772283448713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18300745381176196372.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.05549e+11,0.265058,11156,419,178,13931,2758,257,27640,39,15987,0
Converting to forward existential form...Done !
original formula: EG(AF(((A(AG((i8.u23.p76==1)) U ((i6.u18.p58==1)&&(i0.u0.p3==1))) * (((i2.i0.u3.p11==1) + EX(((i7.u20.p66==1)&&(i1.u1.p121==1)))) + EX(((...294
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(((i6.u18.p58==1)&&(i0.u0.p3==1))) U (!(!(E(TRUE U !((i8.u23.p76==1))))) * !(((i6.u18....460
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t36, t38, t43, t45, t47, t49, t51, i0.t20, i0.u0.t9, i0.u0.t26, i0.u0.t123, i1.u1.t...420
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,21.4564,473008,1,0,547942,110680,1455,3.07285e+06,219,1.19759e+06,277863
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 137
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 137
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 90 transition count 124
Applied a total of 48 rules in 4 ms. Remains 90 /114 variables (removed 24) and now considering 124/148 (removed 24) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:51:31] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:51:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-03 07:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:51:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:51:31] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 326 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/114 places, 124/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 89/114 places, 124/148 transitions.
[2025-06-03 07:51:31] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:31] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:31] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-03 07:51:31] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:51:31] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17009869309756332967.gal : 1 ms
[2025-06-03 07:51:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11154750410452882009.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17009869309756332967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11154750410452882009.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20086e+11,3.56434,88984,2,18824,5,626894,6,0,467,253456,0
Converting to forward existential form...Done !
original formula: AX(EF((p38==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p38==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t111, t112, t113, t114, t115, t11...299
(forward)formula 0,1,21.4311,432920,1,0,175,2.39869e+06,269,117,2810,2.08934e+06,259
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 137
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 137
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 90 transition count 124
Applied a total of 48 rules in 3 ms. Remains 90 /114 variables (removed 24) and now considering 124/148 (removed 24) transitions.
[2025-06-03 07:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:51:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-03 07:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:51:53] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:51:53] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 290 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/114 places, 124/148 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 89/114 places, 124/148 transitions.
[2025-06-03 07:51:53] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:51:53] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:53] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-03 07:51:53] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:53] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1306884596838772808.gal : 0 ms
[2025-06-03 07:51:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8542671548037844240.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1306884596838772808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8542671548037844240.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20086e+11,3.39306,87676,2,18824,5,626894,6,0,467,253456,0
Converting to forward existential form...Done !
original formula: (EX(((p75==1)&&(p121==1))) * AX(AG((p4==1))))
=> equivalent forward existential formula: ([(Init * !(EX(((p75==1)&&(p121==1)))))] = FALSE * [(FwdU(EY(Init),TRUE) * !((p4==1)))] = FALSE)
(forward)formula 0,0,5.39907,91132,1,0,11,639804,10,2,954,287808,4
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 148/148 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 137
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 137
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 90 transition count 124
Applied a total of 48 rules in 3 ms. Remains 90 /114 variables (removed 24) and now considering 124/148 (removed 24) transitions.
[2025-06-03 07:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:51:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-03 07:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:51:58] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:51:59] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 276 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/114 places, 124/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 89/114 places, 124/148 transitions.
[2025-06-03 07:51:59] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:51:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:59] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-03 07:51:59] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:51:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:51:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11360058459289968818.gal : 1 ms
[2025-06-03 07:51:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2602640658223402918.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11360058459289968818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2602640658223402918.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20086e+11,3.24471,88352,2,18824,5,626894,6,0,467,253456,0
Converting to forward existential form...Done !
original formula: EX(((p19==1)&&(p121==1)))
=> equivalent forward existential formula: [(EY(Init) * ((p19==1)&&(p121==1)))] != FALSE
(forward)formula 0,0,3.25965,88352,1,0,8,626894,8,1,626,253456,2
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-03 07:52:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:52:02] [INFO ] Flatten gal took : 3 ms
Total runtime 441612 ms.
BK_STOP 1748937122421
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-12a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-12a, 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 r058-smll-174854064700706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12a.tgz
mv DiscoveryGPU-PT-12a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;