About the Execution of ITS-Tools for MedleyA-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1218.084 | 1040396.00 | 1187343.00 | 3072.60 | FFTFFTTTTTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100122.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717370877866
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 23:28:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:28:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:28:00] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-06-02 23:28:00] [INFO ] Transformed 196 places.
[2024-06-02 23:28:00] [INFO ] Transformed 392 transitions.
[2024-06-02 23:28:00] [INFO ] Found NUPN structural information;
[2024-06-02 23:28:01] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 94 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 367
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 367
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 39 place count 180 transition count 360
Applied a total of 39 rules in 76 ms. Remains 180 /196 variables (removed 16) and now considering 360/390 (removed 30) transitions.
// Phase 1: matrix 360 rows 180 cols
[2024-06-02 23:28:01] [INFO ] Computed 7 invariants in 43 ms
[2024-06-02 23:28:01] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-02 23:28:01] [INFO ] Invariant cache hit.
[2024-06-02 23:28:02] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2024-06-02 23:28:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:28:08] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 40 ms to minimize.
[2024-06-02 23:28:08] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 4 ms to minimize.
[2024-06-02 23:28:08] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2024-06-02 23:28:08] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 7 ms to minimize.
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:28:10] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:28:10] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 4 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:28:12] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 3 ms to minimize.
[2024-06-02 23:28:12] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:28:12] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 4 ms to minimize.
[2024-06-02 23:28:13] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:28:14] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:28:14] [INFO ] Deduced a trap composed of 126 places in 200 ms of which 3 ms to minimize.
[2024-06-02 23:28:14] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:28:15] [INFO ] Deduced a trap composed of 120 places in 225 ms of which 3 ms to minimize.
[2024-06-02 23:28:15] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-02 23:28:15] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:28:20] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:28:23] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:28:23] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 360/540 variables, 180/220 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 3 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 223 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 360/540 variables, 180/223 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 359/582 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:28:44] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 583 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 37/37 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in LTL mode, iteration 1 : 180/196 places, 360/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61695 ms. Remains : 180/196 places, 360/390 transitions.
Support contains 94 out of 180 places after structural reductions.
[2024-06-02 23:29:03] [INFO ] Flatten gal took : 107 ms
[2024-06-02 23:29:03] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:29:03] [INFO ] Input system was already deterministic with 360 transitions.
Support contains 92 out of 180 places (down from 94) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4150 ms. (9 steps per ms) remains 69/79 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 115 ms. (34 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
[2024-06-02 23:29:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 104/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-02 23:29:06] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:29:06] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:29:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-06-02 23:29:06] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:29:07] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:29:07] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:29:07] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:29:07] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:29:07] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-02 23:29:08] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:29:08] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
[2024-06-02 23:29:08] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-02 23:29:09] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 360/540 variables, 180/200 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 200 constraints, problems are : Problem set: 0 solved, 65 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/180 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 13/20 constraints. Problems are: Problem set: 2 solved, 63 unsolved
[2024-06-02 23:29:11] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 4 ms to minimize.
[2024-06-02 23:29:11] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 4 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 9 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 9/29 constraints. Problems are: Problem set: 2 solved, 63 unsolved
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 4 ms to minimize.
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/31 constraints. Problems are: Problem set: 2 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 360/540 variables, 180/211 constraints. Problems are: Problem set: 2 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 63/274 constraints. Problems are: Problem set: 2 solved, 63 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 274 constraints, problems are : Problem set: 2 solved, 63 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 63/65 constraints, Known Traps: 24/24 constraints]
After SMT, in 10115ms problems are : Problem set: 2 solved, 63 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 360/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 180 transition count 354
Reduce places removed 6 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 14 rules applied. Total rules applied 20 place count 174 transition count 346
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 166 transition count 346
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 28 place count 166 transition count 339
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 159 transition count 339
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 151 transition count 327
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 151 transition count 327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 150 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 150 transition count 323
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 84 place count 138 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 137 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 137 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 135 transition count 305
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 135 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 134 transition count 307
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 104 place count 134 transition count 300
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 111 place count 127 transition count 300
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 126 transition count 298
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 126 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 126 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 125 transition count 301
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 125 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 124 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 124 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 123 transition count 298
Applied a total of 124 rules in 233 ms. Remains 123 /180 variables (removed 57) and now considering 298/360 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 123/180 places, 298/360 transitions.
RANDOM walk for 40000 steps (8 resets) in 971 ms. (41 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 55/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
// Phase 1: matrix 298 rows 123 cols
[2024-06-02 23:29:17] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:29:17] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 65/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 3 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 298/421 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/421 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 138 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3002 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 65/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 298/421 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/421 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 187 constraints, problems are : Problem set: 0 solved, 47 unsolved in 6790 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 7/7 constraints]
After SMT, in 9851ms problems are : Problem set: 0 solved, 47 unsolved
Parikh walk visited 10 properties in 11012 ms.
Support contains 47 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 298/298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 123 transition count 293
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 118 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 116 transition count 291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 116 transition count 288
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 113 transition count 288
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 108 transition count 278
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 108 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 105 transition count 275
Performed 7 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 50 place count 98 transition count 319
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 98 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 77 place count 98 transition count 292
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 98 transition count 288
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 85 place count 94 transition count 288
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 86 place count 93 transition count 286
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 93 transition count 286
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 90 place count 93 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 92 transition count 285
Applied a total of 91 rules in 62 ms. Remains 92 /123 variables (removed 31) and now considering 285/298 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 92/123 places, 285/298 transitions.
RANDOM walk for 40000 steps (8 resets) in 308 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
Finished probabilistic random walk after 327365 steps, run visited all 35 properties in 1660 ms. (steps per millisecond=197 )
Probabilistic random walk after 327365 steps, saw 65769 distinct states, run finished after 1674 ms. (steps per millisecond=195 ) properties seen :35
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 23:29:40] [INFO ] Flatten gal took : 38 ms
[2024-06-02 23:29:40] [INFO ] Flatten gal took : 40 ms
[2024-06-02 23:29:40] [INFO ] Input system was already deterministic with 360 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 202 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 4 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 169 transition count 314
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 134 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 132 transition count 310
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 132 transition count 303
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 125 transition count 303
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 112 place count 104 transition count 264
Iterating global reduction 3 with 21 rules applied. Total rules applied 133 place count 104 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 143 place count 104 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 145 place count 102 transition count 254
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 145 place count 102 transition count 251
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 151 place count 99 transition count 251
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 96 transition count 243
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 96 transition count 243
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 185 place count 82 transition count 229
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 79 transition count 222
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 79 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 205 place count 79 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 205 place count 79 transition count 206
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 77 transition count 206
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 217 place count 73 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 72 transition count 201
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 70 vertex of which 26 / 70 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 54 transition count 201
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 263 place count 54 transition count 159
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 52 transition count 142
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 52 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 308 place count 52 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 6 rules applied. Total rules applied 314 place count 52 transition count 95
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 320 place count 46 transition count 95
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 322 place count 44 transition count 90
Iterating global reduction 9 with 2 rules applied. Total rules applied 324 place count 44 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 328 place count 42 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 332 place count 42 transition count 84
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 334 place count 42 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 336 place count 40 transition count 82
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 336 place count 40 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 340 place count 38 transition count 80
Applied a total of 340 rules in 165 ms. Remains 38 /180 variables (removed 142) and now considering 80/360 (removed 280) transitions.
// Phase 1: matrix 80 rows 38 cols
[2024-06-02 23:29:40] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:29:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:29:40] [INFO ] Invariant cache hit.
[2024-06-02 23:29:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:29:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 23:29:40] [INFO ] Redundant transitions in 22 ms returned [79]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 75 sub problems to find dead transitions.
// Phase 1: matrix 79 rows 38 cols
[2024-06-02 23:29:40] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:29:40] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:29:41] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 78/116 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 66 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 23:29:43] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 78/116 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 75/142 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 23:29:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2640 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 9/9 constraints]
After SMT, in 5177ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 5180ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/180 places, 79/360 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 77
Applied a total of 4 rules in 8 ms. Remains 36 /38 variables (removed 2) and now considering 77/79 (removed 2) transitions.
// Phase 1: matrix 77 rows 36 cols
[2024-06-02 23:29:45] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:29:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:29:46] [INFO ] Invariant cache hit.
[2024-06-02 23:29:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:29:46] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/180 places, 77/360 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5792 ms. Remains : 36/180 places, 77/360 transitions.
[2024-06-02 23:29:46] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:29:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:29:46] [INFO ] Input system was already deterministic with 77 transitions.
[2024-06-02 23:29:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:29:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:29:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15295696571154048880.gal : 5 ms
[2024-06-02 23:29:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3964381633806099983.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15295696571154048880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3964381633806099983.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1530,0.098612,4964,2,836,5,5323,5,0,222,4088,0
Converting to forward existential form...Done !
original formula: AF(AG((p23==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p23==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t9, t12, t13, t14, t16, t18, t20, t55, t56, t59, t60, Intersection with reac...230
(forward)formula 0,0,0.711612,17360,1,0,215,54904,179,125,1933,49437,221
FORMULA MedleyA-PT-16-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 320
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 320
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 157 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 155 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 155 transition count 310
Applied a total of 58 rules in 11 ms. Remains 155 /180 variables (removed 25) and now considering 310/360 (removed 50) transitions.
// Phase 1: matrix 310 rows 155 cols
[2024-06-02 23:29:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:29:47] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 23:29:47] [INFO ] Invariant cache hit.
[2024-06-02 23:29:47] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:29:50] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:29:50] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:29:50] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:29:52] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:29:52] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:29:52] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 3 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:29:54] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:29:55] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:29:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:29:55] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:29:55] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/465 variables, 155/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:30:01] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-02 23:30:01] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:30:06] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:30:06] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/465 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 190 constraints, problems are : Problem set: 0 solved, 309 unsolved in 28205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/465 variables, 155/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 309/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:30:36] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 500 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 29/29 constraints]
After SMT, in 58319ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 58323ms
Starting structural reductions in LTL mode, iteration 1 : 155/180 places, 310/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58759 ms. Remains : 155/180 places, 310/360 transitions.
[2024-06-02 23:30:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:30:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:30:45] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 23:30:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:30:45] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:30:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16319525470295539774.gal : 10 ms
[2024-06-02 23:30:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11119518720613145566.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16319525470295539774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11119518720613145566.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.62643e+06,1.37954,32428,2,7838,5,96288,6,0,932,123363,0
Converting to forward existential form...Done !
original formula: AX(AG(EF((EX((p80==1)) * (EX(((p74==1)&&(p168==1))) + EG((p182==1)))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (EX((p80==1)) * (EX(((p74==1)&&(p168==1))) + EG((p182==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t15, t19, t26, t27, t28, t30, t34, t35, t40, t44, t47, t51, t54, t56, t58, t59, t64,...546
(forward)formula 0,0,8.91135,206776,1,0,631,1.0728e+06,650,315,7398,826278,721
FORMULA MedleyA-PT-16-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 202 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 169 transition count 314
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 134 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 132 transition count 310
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 132 transition count 303
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 125 transition count 303
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 113 place count 103 transition count 262
Iterating global reduction 3 with 22 rules applied. Total rules applied 135 place count 103 transition count 262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 145 place count 103 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 101 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 147 place count 101 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 153 place count 98 transition count 249
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 156 place count 95 transition count 241
Iterating global reduction 5 with 3 rules applied. Total rules applied 159 place count 95 transition count 241
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 187 place count 81 transition count 227
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 190 place count 78 transition count 220
Iterating global reduction 5 with 3 rules applied. Total rules applied 193 place count 78 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 206 place count 78 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 206 place count 78 transition count 205
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 76 transition count 205
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 218 place count 72 transition count 201
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 72 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 71 transition count 200
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 82 edges and 69 vertex of which 26 / 69 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 224 place count 53 transition count 200
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 266 place count 53 transition count 158
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 268 place count 51 transition count 141
Iterating global reduction 7 with 2 rules applied. Total rules applied 270 place count 51 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 311 place count 51 transition count 100
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 4 rules applied. Total rules applied 315 place count 51 transition count 96
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 319 place count 47 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 323 place count 45 transition count 94
Applied a total of 323 rules in 85 ms. Remains 45 /180 variables (removed 135) and now considering 94/360 (removed 266) transitions.
// Phase 1: matrix 94 rows 45 cols
[2024-06-02 23:30:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:30:55] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:30:55] [INFO ] Invariant cache hit.
[2024-06-02 23:30:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:30:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 23:30:55] [INFO ] Redundant transitions in 227 ms returned [90, 91, 92, 93]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 90 rows 45 cols
[2024-06-02 23:30:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:30:55] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 23:30:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:30:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:30:56] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 75 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 86/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 23:30:59] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 162 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 10/10 constraints]
After SMT, in 6207ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 6208ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/180 places, 90/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 43 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 43 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 41 transition count 84
Applied a total of 10 rules in 13 ms. Remains 41 /45 variables (removed 4) and now considering 84/90 (removed 6) transitions.
// Phase 1: matrix 84 rows 41 cols
[2024-06-02 23:31:01] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:31:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:31:01] [INFO ] Invariant cache hit.
[2024-06-02 23:31:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:31:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/180 places, 84/360 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6933 ms. Remains : 41/180 places, 84/360 transitions.
[2024-06-02 23:31:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:31:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:31:01] [INFO ] Input system was already deterministic with 84 transitions.
[2024-06-02 23:31:01] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:31:02] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:31:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6082921796483224506.gal : 2 ms
[2024-06-02 23:31:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15757366038380662678.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6082921796483224506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15757366038380662678.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 31260 steps (6744 resets) in 247 ms. (126 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 189 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 169 transition count 316
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 136 transition count 312
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 134 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 133 transition count 311
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 75 place count 133 transition count 304
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 89 place count 126 transition count 304
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 111 place count 104 transition count 263
Iterating global reduction 4 with 22 rules applied. Total rules applied 133 place count 104 transition count 263
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 143 place count 104 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 102 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 145 place count 102 transition count 251
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 149 place count 100 transition count 251
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 152 place count 97 transition count 243
Iterating global reduction 6 with 3 rules applied. Total rules applied 155 place count 97 transition count 243
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 183 place count 83 transition count 229
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 186 place count 80 transition count 222
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 80 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 202 place count 80 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 202 place count 80 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 206 place count 78 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 214 place count 74 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 215 place count 73 transition count 202
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 78 edges and 71 vertex of which 23 / 71 are part of one of the 9 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 218 place count 57 transition count 202
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 254 place count 57 transition count 166
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 256 place count 55 transition count 148
Iterating global reduction 8 with 2 rules applied. Total rules applied 258 place count 55 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 298 place count 55 transition count 108
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 4 rules applied. Total rules applied 302 place count 55 transition count 104
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 307 place count 51 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 308 place count 50 transition count 103
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 309 place count 49 transition count 100
Iterating global reduction 11 with 1 rules applied. Total rules applied 310 place count 49 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 314 place count 47 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 316 place count 47 transition count 96
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 11 with 1 rules applied. Total rules applied 317 place count 47 transition count 95
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 319 place count 46 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 320 place count 45 transition count 94
Applied a total of 320 rules in 63 ms. Remains 45 /180 variables (removed 135) and now considering 94/360 (removed 266) transitions.
// Phase 1: matrix 94 rows 45 cols
[2024-06-02 23:31:02] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:31:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:31:02] [INFO ] Invariant cache hit.
[2024-06-02 23:31:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:31:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 23:31:02] [INFO ] Redundant transitions in 28 ms returned [86, 88, 91, 92]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 90 rows 45 cols
[2024-06-02 23:31:02] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:31:02] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 23:31:02] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:31:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-06-02 23:31:02] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 23:31:03] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:31:03] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-06-02 23:31:03] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 23:31:04] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 89/134 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 73 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3677 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 89/134 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 86/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 23:31:07] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 160 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3347 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
After SMT, in 7071ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 7073ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/180 places, 90/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 43 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 42 transition count 85
Applied a total of 8 rules in 13 ms. Remains 42 /45 variables (removed 3) and now considering 85/90 (removed 5) transitions.
// Phase 1: matrix 85 rows 42 cols
[2024-06-02 23:31:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:31:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 23:31:09] [INFO ] Invariant cache hit.
[2024-06-02 23:31:09] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:31:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/180 places, 85/360 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7552 ms. Remains : 42/180 places, 85/360 transitions.
[2024-06-02 23:31:09] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:31:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:31:09] [INFO ] Input system was already deterministic with 85 transitions.
[2024-06-02 23:31:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:31:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14903268886890136092.gal : 5 ms
[2024-06-02 23:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18375593882852818714.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14903268886890136092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18375593882852818714.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5640,0.1019,5600,2,1026,5,7699,5,0,254,6895,0
Converting to forward existential form...Done !
original formula: EG(AG(AF((((p74==0)||(p168==0))&&(((p17==0)||(p42==0))||(p195==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((((p74==0)||(p168==0))&&(((p17==0)||(p42==0))||(p195==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t10, t12, t14, t17, t18, t20, t22, t24, t27, t28, t29, t61, t62, t65, t66, t67, t...257
(forward)formula 0,0,0.71214,21400,1,0,200,87756,199,98,2115,64938,205
FORMULA MedleyA-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 158 transition count 324
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 158 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 158 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 156 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 156 transition count 319
Applied a total of 51 rules in 6 ms. Remains 156 /180 variables (removed 24) and now considering 319/360 (removed 41) transitions.
// Phase 1: matrix 319 rows 156 cols
[2024-06-02 23:31:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:31:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:31:10] [INFO ] Invariant cache hit.
[2024-06-02 23:31:10] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-06-02 23:31:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 23:31:14] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-06-02 23:31:14] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:31:14] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:31:14] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:31:14] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:31:14] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:31:15] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 4 ms to minimize.
[2024-06-02 23:31:15] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:31:15] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:31:15] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:31:15] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:31:15] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:31:16] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:31:16] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:31:16] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:31:17] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:31:17] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:31:17] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:31:17] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 5 ms to minimize.
[2024-06-02 23:31:18] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 23:31:18] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:31:19] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:31:19] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:31:19] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-06-02 23:31:19] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:31:19] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:31:20] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:31:20] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 319/475 variables, 156/195 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 196 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/475 variables, 156/196 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 318/514 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 514 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 33/33 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LTL mode, iteration 1 : 156/180 places, 319/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 156/180 places, 319/360 transitions.
[2024-06-02 23:32:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:32:11] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:32:11] [INFO ] Input system was already deterministic with 319 transitions.
[2024-06-02 23:32:11] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:32:11] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:32:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17008492013676005204.gal : 5 ms
[2024-06-02 23:32:11] [INFO ] Time to serialize properties into /tmp/CTLFireability295257508295549834.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17008492013676005204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability295257508295549834.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.92514e+06,1.48612,33292,2,8197,5,96926,6,0,945,126187,0
Converting to forward existential form...Done !
original formula: EG((EG((((((p9==0)&&(p11==0))||(p94==0))||(p156==0))&&((((p74==0)||(p159==0))||((p95==0)||(p160==0)))||(((p26==0)||(p51==0))||((p195==0)|...271
=> equivalent forward existential formula: [FwdG(Init,(EG((((((p9==0)&&(p11==0))||(p94==0))||(p156==0))&&((((p74==0)||(p159==0))||((p95==0)||(p160==0)))||(...338
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64,...587
Detected timeout of ITS tools.
[2024-06-02 23:32:41] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:32:41] [INFO ] Applying decomposition
[2024-06-02 23:32:41] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10230251749839801539.txt' '-o' '/tmp/graph10230251749839801539.bin' '-w' '/tmp/graph10230251749839801539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10230251749839801539.bin' '-l' '-1' '-v' '-w' '/tmp/graph10230251749839801539.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:32:41] [INFO ] Decomposing Gal with order
[2024-06-02 23:32:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:32:41] [INFO ] Removed a total of 384 redundant transitions.
[2024-06-02 23:32:41] [INFO ] Flatten gal took : 120 ms
[2024-06-02 23:32:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 32 ms.
[2024-06-02 23:32:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9222610372590119611.gal : 11 ms
[2024-06-02 23:32:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16006142447553829378.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9222610372590119611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16006142447553829378.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.92514e+06,0.63386,19560,925,34,29664,339,661,56345,66,904,0
Converting to forward existential form...Done !
original formula: EG((EG((((((i0.u2.p9==0)&&(i0.u5.p11==0))||(i4.u33.p94==0))||(i9.i0.u52.p156==0))&&((((i2.u22.p74==0)||(i1.u53.p159==0))||((i4.u33.p95==0...419
=> equivalent forward existential formula: [FwdG(Init,(EG((((((i0.u2.p9==0)&&(i0.u5.p11==0))||(i4.u33.p94==0))||(i9.i0.u52.p156==0))&&((((i2.u22.p74==0)||(...486
Reverse transition relation is NOT exact ! Due to transitions t26, t29, t46, t57, t58, t83, t86, t96, t103, t116, t117, t163, t165, t171, t173, t180, t181,...837
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
(forward)formula 0,0,3.65844,87936,1,0,148345,486,3970,400940,302,1233,394331
FORMULA MedleyA-PT-16-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 166 edges and 180 vertex of which 9 / 180 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 172 transition count 324
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 144 transition count 320
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 67 place count 142 transition count 316
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 71 place count 138 transition count 316
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 71 place count 138 transition count 309
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 85 place count 131 transition count 309
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 101 place count 115 transition count 279
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 115 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 123 place count 115 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 123 place count 115 transition count 271
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 127 place count 113 transition count 271
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 112 transition count 267
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 112 transition count 267
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 159 place count 97 transition count 252
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 94 transition count 245
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 94 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 176 place count 94 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 176 place count 94 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 92 transition count 232
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 186 place count 89 transition count 229
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 89 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 87 transition count 227
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 68 edges and 85 vertex of which 14 / 85 are part of one of the 6 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 192 place count 77 transition count 227
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 201 place count 77 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 7 with 44 rules applied. Total rules applied 245 place count 77 transition count 174
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 247 place count 77 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 249 place count 75 transition count 172
Applied a total of 249 rules in 47 ms. Remains 75 /180 variables (removed 105) and now considering 172/360 (removed 188) transitions.
// Phase 1: matrix 172 rows 75 cols
[2024-06-02 23:32:45] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:32:45] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-02 23:32:45] [INFO ] Invariant cache hit.
[2024-06-02 23:32:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:32:45] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-06-02 23:32:46] [INFO ] Redundant transitions in 87 ms returned [69, 70, 71, 72, 74, 75, 76, 78, 79, 80, 82, 83, 84, 89, 90, 92, 93, 94, 95, 96, 98, 165, 166, 167, 169, 170]
Found 26 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 26 transitions
Redundant transitions reduction (with SMT) removed 26 transitions.
Running 142 sub problems to find dead transitions.
// Phase 1: matrix 146 rows 75 cols
[2024-06-02 23:32:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:32:46] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 23:32:46] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-02 23:32:46] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:32:46] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:32:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:32:46] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:32:46] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:32:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 145/220 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 23:32:48] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 104 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 145/220 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 142/246 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 23:32:54] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 247 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 9/9 constraints]
After SMT, in 13222ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 13224ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/180 places, 146/360 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 73 transition count 144
Applied a total of 4 rules in 7 ms. Remains 73 /75 variables (removed 2) and now considering 144/146 (removed 2) transitions.
// Phase 1: matrix 144 rows 73 cols
[2024-06-02 23:32:59] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:32:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:32:59] [INFO ] Invariant cache hit.
[2024-06-02 23:32:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:32:59] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 73/180 places, 144/360 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14027 ms. Remains : 73/180 places, 144/360 transitions.
[2024-06-02 23:32:59] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:32:59] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:32:59] [INFO ] Input system was already deterministic with 144 transitions.
[2024-06-02 23:32:59] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:32:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:32:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9815804072354695920.gal : 3 ms
[2024-06-02 23:32:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9255503515832609935.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9815804072354695920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9255503515832609935.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,51538,0.177905,6764,2,1202,5,11430,5,0,437,10533,0
Converting to forward existential form...Done !
original formula: (AF(((((p103==1)&&(p168==1)) + EG((A(((p74==1)&&(p159==1)) U (p85==1)) + EF(((p94==1)&&(p160==1)))))) + A((EG((p90==1)) + E((p135==1) U (...319
=> equivalent forward existential formula: [FwdG((Init * !((!(!((E(!(((!(EG((p41==1))) + (p191==1)) + ((p49==1)||(p76==1)))) U (!((EG((p64==1)) + !(((p85==...606
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t13, t16, t22, t25, t30, t33, t34, t35, t36, t37, t39, t41, t43, t46, t48, ...348
Fast SCC detection found an SCC at level 0
Fast SCC detection found an SCC at level 0
(forward)formula 0,1,2.39743,56936,1,0,500,303047,361,314,3218,261328,597
FORMULA MedleyA-PT-16-CTLFireability-2024-05 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 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 320
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 320
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 157 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 156 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 156 transition count 311
Applied a total of 56 rules in 5 ms. Remains 156 /180 variables (removed 24) and now considering 311/360 (removed 49) transitions.
// Phase 1: matrix 311 rows 156 cols
[2024-06-02 23:33:01] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:33:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 23:33:02] [INFO ] Invariant cache hit.
[2024-06-02 23:33:02] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-06-02 23:33:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 23:33:06] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:33:06] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:33:06] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:33:06] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:33:07] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:33:07] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-06-02 23:33:07] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:33:07] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:33:07] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:33:08] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:33:08] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:33:10] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:33:10] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 23:33:11] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:33:12] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:33:12] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-06-02 23:33:13] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:33:13] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 23:33:16] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:33:17] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 311/467 variables, 156/188 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 23:33:24] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 189 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 311/467 variables, 156/189 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 310/499 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 499 constraints, problems are : Problem set: 0 solved, 310 unsolved in 28413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 26/26 constraints]
After SMT, in 58561ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 58566ms
Starting structural reductions in LTL mode, iteration 1 : 156/180 places, 311/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58991 ms. Remains : 156/180 places, 311/360 transitions.
[2024-06-02 23:34:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:34:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:34:01] [INFO ] Input system was already deterministic with 311 transitions.
[2024-06-02 23:34:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:34:01] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:34:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9986559617717593010.gal : 6 ms
[2024-06-02 23:34:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3377408878168233629.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9986559617717593010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3377408878168233629.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.72491e+06,1.50056,32208,2,7889,5,96236,6,0,937,122302,0
Converting to forward existential form...Done !
original formula: (!(E((p101==1) U (AF(((p84==1)&&(p138==1))) * (p143==1)))) * AX(AF((((p179==1) * EG((p161==1))) + EF(EX((p163==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,(p101==1)) * (p143==1)) * !(EG(!(((p84==1)&&(p138==1))))))] = FALSE * [FwdG(EY(Init),!((((p179==1)...211
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t44, t47, t51, t54, t56, t58, t59, t65, t66,...541
Hit Full ! (commute/partial/dont) 309/0/2
(forward)formula 0,1,16.9907,363760,1,0,646,2.26099e+06,669,322,7166,1.57119e+06,737
FORMULA MedleyA-PT-16-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 160 transition count 327
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 160 transition count 327
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 48 place count 160 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 158 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 158 transition count 317
Applied a total of 52 rules in 5 ms. Remains 158 /180 variables (removed 22) and now considering 317/360 (removed 43) transitions.
// Phase 1: matrix 317 rows 158 cols
[2024-06-02 23:34:18] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:34:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:34:18] [INFO ] Invariant cache hit.
[2024-06-02 23:34:18] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 23:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:34:22] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:34:22] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:34:23] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:34:23] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:34:23] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2024-06-02 23:34:23] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:34:23] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:34:23] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:34:24] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:34:24] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:34:24] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:34:24] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:34:25] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:34:25] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:34:25] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:34:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:34:26] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:34:26] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:34:26] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-06-02 23:34:27] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:34:27] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:34:27] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:34:28] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:34:28] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:34:28] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:34:31] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:34:31] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:34:31] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:34:31] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:34:31] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:34:32] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 317/475 variables, 158/196 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:34:39] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-02 23:34:40] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 198 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/475 variables, 158/198 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 316/514 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 0/475 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 514 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 33/33 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 158/180 places, 317/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 158/180 places, 317/360 transitions.
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:35:18] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:35:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8958575305294998316.gal : 5 ms
[2024-06-02 23:35:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1994326526316614833.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8958575305294998316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1994326526316614833.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.32138e+06,1.52555,32496,2,7751,5,95362,6,0,951,122750,0
Converting to forward existential form...Done !
original formula: (!(A((((!(EX(((p58==1)&&(p138==1)))) + (!((((p84==1)&&(p123==1))||((p42==1)&&(p177==1)))) * (AF((p75==1)) + !(((p73==1)&&(p131==1)))))) *...649
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(!(!(E(TRUE U (p38==1)))))))))) * !(E(!(!(EX(!(!(E(TRUE U (p38==1))))))) U (!((((!(EX(((p5...2351
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t24, t27, t28, t29, t31, t32, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...586
Detected timeout of ITS tools.
[2024-06-02 23:35:48] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:35:48] [INFO ] Applying decomposition
[2024-06-02 23:35:48] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17330799330240776810.txt' '-o' '/tmp/graph17330799330240776810.bin' '-w' '/tmp/graph17330799330240776810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17330799330240776810.bin' '-l' '-1' '-v' '-w' '/tmp/graph17330799330240776810.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:35:49] [INFO ] Decomposing Gal with order
[2024-06-02 23:35:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:35:49] [INFO ] Removed a total of 385 redundant transitions.
[2024-06-02 23:35:49] [INFO ] Flatten gal took : 39 ms
[2024-06-02 23:35:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 21 ms.
[2024-06-02 23:35:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6753490839981778277.gal : 10 ms
[2024-06-02 23:35:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12729369315855154076.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6753490839981778277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12729369315855154076.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.32138e+06,0.313352,9148,611,22,9717,287,642,21866,47,946,0
Converting to forward existential form...Done !
original formula: (!(A((((!(EX(((i0.u17.p58==1)&&(i7.u45.p138==1)))) + (!((((i5.i0.u27.p84==1)&&(i0.u40.p123==1))||((i1.u12.p42==1)&&(i7.u47.p177==1)))) * ...1017
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(!(!(E(TRUE U (i1.u10.p38==1)))))))))) * !(E(!(!(EX(!(!(E(TRUE U (i1.u10.p38==1))))))) U (...3464
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t31, t48, t89, t93, t106, t166, t168, t174, t176, t183, t184, t186, t187, t188, t18...828
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 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
(forward)formula 0,1,1.89727,49012,1,0,71322,287,3966,255912,202,946,174096
FORMULA MedleyA-PT-16-CTLFireability-2024-07 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 : 180/180 places, 360/360 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 155 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 155 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 155 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 153 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 153 transition count 308
Applied a total of 62 rules in 6 ms. Remains 153 /180 variables (removed 27) and now considering 308/360 (removed 52) transitions.
// Phase 1: matrix 308 rows 153 cols
[2024-06-02 23:35:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:35:51] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 23:35:51] [INFO ] Invariant cache hit.
[2024-06-02 23:35:51] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 23:35:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:35:55] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-02 23:35:55] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:35:55] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 3 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 5 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:36:00] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:36:00] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:36:05] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:36:07] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:36:08] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:36:10] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/461 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:36:16] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 188 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 495 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 153/180 places, 308/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60664 ms. Remains : 153/180 places, 308/360 transitions.
[2024-06-02 23:36:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:36:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:36:51] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 23:36:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:36:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:36:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5189304270546276569.gal : 4 ms
[2024-06-02 23:36:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12095081818419279165.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5189304270546276569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12095081818419279165.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44045e+06,1.54452,32596,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: AX(EF((p104==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p104==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,1,16.7556,358372,1,0,599,2.26787e+06,637,308,6969,1.4683e+06,685
FORMULA MedleyA-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 322
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 157 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 156 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 156 transition count 313
Applied a total of 56 rules in 4 ms. Remains 156 /180 variables (removed 24) and now considering 313/360 (removed 47) transitions.
// Phase 1: matrix 313 rows 156 cols
[2024-06-02 23:37:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:37:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:37:08] [INFO ] Invariant cache hit.
[2024-06-02 23:37:09] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-06-02 23:37:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 23:37:13] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:37:13] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:37:13] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 8 ms to minimize.
[2024-06-02 23:37:13] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:37:14] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:37:14] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:37:14] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:37:14] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:37:14] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:37:15] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:37:15] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:37:16] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:37:16] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:37:16] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:37:16] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:37:16] [INFO ] Deduced a trap composed of 116 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:37:17] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:37:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:37:17] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 23:37:18] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:37:19] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 23:37:22] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:37:23] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:37:23] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 23:37:25] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 313/469 variables, 156/188 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 23:37:33] [INFO ] Deduced a trap composed of 114 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:37:33] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 190 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/469 variables, 156/190 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 312/502 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/469 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 502 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 27/27 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 156/180 places, 313/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 156/180 places, 313/360 transitions.
[2024-06-02 23:38:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:38:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:38:09] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-02 23:38:09] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:38:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:38:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17178133918555547509.gal : 2 ms
[2024-06-02 23:38:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10506080082538287191.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17178133918555547509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10506080082538287191.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.62726e+06,1.32114,30360,2,7179,5,89486,6,0,939,116515,0
Converting to forward existential form...Done !
original formula: (EX(E((!(((AX((p24==1)) + (p169==1)) + ((p88==1)&&(p159==1)))) * (p150!=1)) U (((p50==1)&&(p181==1))&&(p190==1)))) + E(A(AX(AX((p157==1))...211
=> equivalent forward existential formula: ([(FwdU(EY(Init),(!(((!(EX(!((p24==1)))) + (p169==1)) + ((p88==1)&&(p159==1)))) * (p150!=1))) * (((p50==1)&&(p18...401
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t26, t27, t28, t29, t30, t32, t36, t37, t42, t46, t49, t53, t56, t58, t60, t61,...563
(forward)formula 0,1,17.504,384764,1,0,891,1.66571e+06,651,519,6921,2.36173e+06,981
FORMULA MedleyA-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 155 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 155 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 155 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 153 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 153 transition count 308
Applied a total of 62 rules in 4 ms. Remains 153 /180 variables (removed 27) and now considering 308/360 (removed 52) transitions.
// Phase 1: matrix 308 rows 153 cols
[2024-06-02 23:38:27] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:27] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 23:38:27] [INFO ] Invariant cache hit.
[2024-06-02 23:38:27] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 23:38:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:38:34] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:38:34] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:38:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:38:35] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:38:36] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:38:36] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:38:36] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:38:40] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:38:42] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:38:42] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:38:44] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/461 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:38:50] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 188 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:39:18] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 496 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 29/29 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 153/180 places, 308/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60580 ms. Remains : 153/180 places, 308/360 transitions.
[2024-06-02 23:39:27] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:39:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:39:27] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 23:39:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:39:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:39:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9350456823605535673.gal : 3 ms
[2024-06-02 23:39:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8167752362497058998.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9350456823605535673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8167752362497058998.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.44045e+06,1.18926,32868,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: AG(EX(AX(!(E((p169==1) U ((p103==1)&&(p153==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(!(E((p169==1) U ((p103==1)&&(p153==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,5.50966,123632,1,0,570,597310,636,288,6762,465206,631
FORMULA MedleyA-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 157 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 155 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 155 transition count 314
Applied a total of 56 rules in 5 ms. Remains 155 /180 variables (removed 25) and now considering 314/360 (removed 46) transitions.
// Phase 1: matrix 314 rows 155 cols
[2024-06-02 23:39:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:39:33] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 23:39:33] [INFO ] Invariant cache hit.
[2024-06-02 23:39:33] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 23:39:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:39:37] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:39:37] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:39:37] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:39:38] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-06-02 23:39:38] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:39:38] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:39:38] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:39:39] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:39:39] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:39:44] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:39:44] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:39:44] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 7 ms to minimize.
[2024-06-02 23:39:45] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:39:47] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:39:47] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/469 variables, 155/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/469 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 185 constraints, problems are : Problem set: 0 solved, 313 unsolved in 29929 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:40:09] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:40:11] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/469 variables, 155/189 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 313/502 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 502 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 27/27 constraints]
After SMT, in 60025ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60029ms
Starting structural reductions in LTL mode, iteration 1 : 155/180 places, 314/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 155/180 places, 314/360 transitions.
[2024-06-02 23:40:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:40:33] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:40:33] [INFO ] Input system was already deterministic with 314 transitions.
[2024-06-02 23:40:33] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:40:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:40:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2672482908908504854.gal : 3 ms
[2024-06-02 23:40:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13909368724539511303.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2672482908908504854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13909368724539511303.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.62327e+06,1.22478,32484,2,7974,5,98389,6,0,936,124763,0
Converting to forward existential form...Done !
original formula: !(E(((EX(E((p172==1) U (p129==1))) + !(((p70==1)||((p58==1)&&(p123==1))))) + ((p154!=1)||((p54==1)&&(p134==1)))) U AF((p157==1))))
=> equivalent forward existential formula: [(FwdU(Init,((EX(E((p172==1) U (p129==1))) + !(((p70==1)||((p58==1)&&(p123==1))))) + ((p154!=1)||((p54==1)&&(p13...196
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t28, t29, t31, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...567
(forward)formula 0,0,22.1108,486004,1,0,911,1.9275e+06,663,526,7031,3.18482e+06,1019
FORMULA MedleyA-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 187 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 169 transition count 317
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 137 transition count 313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 135 transition count 313
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 135 transition count 306
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 128 transition count 306
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 105 place count 108 transition count 269
Iterating global reduction 3 with 20 rules applied. Total rules applied 125 place count 108 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 135 place count 108 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 106 transition count 259
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 137 place count 106 transition count 256
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 143 place count 103 transition count 256
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 146 place count 100 transition count 248
Iterating global reduction 5 with 3 rules applied. Total rules applied 149 place count 100 transition count 248
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 171 place count 89 transition count 237
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 88 transition count 234
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 88 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 186 place count 88 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 186 place count 88 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 86 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 196 place count 83 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 83 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 82 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 82 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 82 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 201 place count 81 transition count 213
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 79 vertex of which 24 / 79 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 204 place count 64 transition count 213
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 241 place count 64 transition count 176
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 242 place count 63 transition count 166
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 63 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 8 with 45 rules applied. Total rules applied 288 place count 63 transition count 121
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 4 rules applied. Total rules applied 292 place count 63 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 296 place count 59 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 300 place count 57 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 302 place count 57 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 2 rules applied. Total rules applied 304 place count 57 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 306 place count 55 transition count 111
Applied a total of 306 rules in 36 ms. Remains 55 /180 variables (removed 125) and now considering 111/360 (removed 249) transitions.
// Phase 1: matrix 111 rows 55 cols
[2024-06-02 23:40:56] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 23:40:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 23:40:56] [INFO ] Invariant cache hit.
[2024-06-02 23:40:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-02 23:40:56] [INFO ] Redundant transitions in 36 ms returned [45, 46, 47, 104, 105, 106, 108, 110]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 99 sub problems to find dead transitions.
// Phase 1: matrix 103 rows 55 cols
[2024-06-02 23:40:56] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:40:57] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 102/157 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 71 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3875 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 102/157 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 99/170 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 170 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 11/11 constraints]
After SMT, in 7096ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 7098ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/180 places, 103/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 55 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 52 transition count 100
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 7 place count 52 transition count 99
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 52 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 51 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 51 transition count 98
Applied a total of 10 rules in 13 ms. Remains 51 /55 variables (removed 4) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 51 cols
[2024-06-02 23:41:03] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:41:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 23:41:03] [INFO ] Invariant cache hit.
[2024-06-02 23:41:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/180 places, 98/360 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7549 ms. Remains : 51/180 places, 98/360 transitions.
[2024-06-02 23:41:03] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:41:03] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:41:03] [INFO ] Input system was already deterministic with 98 transitions.
[2024-06-02 23:41:03] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:41:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:41:03] [INFO ] Time to serialize gal into /tmp/CTLFireability7797726043174726303.gal : 1 ms
[2024-06-02 23:41:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10322988932913983539.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7797726043174726303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10322988932913983539.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,12266,0.215228,7820,2,1864,5,14729,5,0,303,12333,0
Converting to forward existential form...Done !
original formula: EF(AG((AG((((p188==1)||(p67==1))||(p142==1))) + EG((((p74==0)||(p131==0))&&(p174==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((((p188==1)||(p67==1))||(p142==1))))) + EG((((p74==0)||(p131==0))...183
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t9, t15, t16, t18, t20, t22, t25, t26, t28, t30, t32, t39, t40, t41, t77, t78, t81, t...277
(forward)formula 0,0,1.16946,26004,1,0,207,104186,222,105,2479,75804,224
FORMULA MedleyA-PT-16-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 160 transition count 327
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 160 transition count 327
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 48 place count 160 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 159 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 159 transition count 318
Applied a total of 50 rules in 6 ms. Remains 159 /180 variables (removed 21) and now considering 318/360 (removed 42) transitions.
// Phase 1: matrix 318 rows 159 cols
[2024-06-02 23:41:04] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:41:04] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:41:04] [INFO ] Invariant cache hit.
[2024-06-02 23:41:05] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2024-06-02 23:41:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-06-02 23:41:10] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:41:10] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:41:10] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:41:10] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:41:11] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:41:11] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2024-06-02 23:41:11] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:41:11] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:41:11] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:41:12] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:41:12] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 109 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 23:41:14] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:41:15] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:41:15] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:41:15] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:41:15] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:41:16] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 23:41:20] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:41:20] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 318/477 variables, 159/194 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 23:41:29] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:41:29] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/477 variables, and 196 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/477 variables, 159/196 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 317/513 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 513 constraints, problems are : Problem set: 0 solved, 317 unsolved in 28647 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 30/30 constraints]
After SMT, in 58808ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 58813ms
Starting structural reductions in LTL mode, iteration 1 : 159/180 places, 318/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59238 ms. Remains : 159/180 places, 318/360 transitions.
[2024-06-02 23:42:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:42:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:42:04] [INFO ] Input system was already deterministic with 318 transitions.
[2024-06-02 23:42:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:42:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13380293518561801032.gal : 3 ms
[2024-06-02 23:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7928319910215368985.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13380293518561801032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7928319910215368985.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.42709e+06,1.37533,28284,2,6441,5,79020,6,0,956,105581,0
Converting to forward existential form...Done !
original formula: EF(((p171==1) * (!(E((A(((p73==1)&&(p131==1)) U (p7==1)) * (p161==1)) U EG((p146==1)))) + A(AX((p24!=1)) U ((EG((p106==1)) + ((p101==1)&&...196
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (p171==1)) * !(E((!((E(!((p7==1)) U (!(((p73==1)&&(p131==1))) * !((p7==1)))) + EG(!((p7==1...643
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64,...605
(forward)formula 0,1,6.10295,124464,1,0,625,641622,673,305,7014,530842,687
FORMULA MedleyA-PT-16-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 155 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 155 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 155 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 153 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 153 transition count 308
Applied a total of 62 rules in 4 ms. Remains 153 /180 variables (removed 27) and now considering 308/360 (removed 52) transitions.
// Phase 1: matrix 308 rows 153 cols
[2024-06-02 23:42:10] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:42:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 23:42:10] [INFO ] Invariant cache hit.
[2024-06-02 23:42:10] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 23:42:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:42:16] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:42:16] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:42:17] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 3 ms to minimize.
[2024-06-02 23:42:17] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:42:17] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:42:18] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:42:18] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:42:19] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:42:20] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:42:20] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:42:20] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:42:20] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:42:20] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:42:21] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:42:21] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:42:25] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:42:27] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:42:28] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/461 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:42:35] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 188 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 495 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 153/180 places, 308/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60531 ms. Remains : 153/180 places, 308/360 transitions.
[2024-06-02 23:43:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:10] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 23:43:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:10] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:43:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17604617676248721635.gal : 4 ms
[2024-06-02 23:43:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17896801943038470711.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17604617676248721635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17896801943038470711.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.44045e+06,1.44114,32884,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: AG(E((EX((E((((p43==1)&&(p116==1))&&(p190==1)) U (((p12==1)&&(p35==1))&&(p192==1))) * E((p159==1) U (p193==1)))) + (p176==1)) U (!(EF((((...215
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EX((E((((p43==1)&&(p116==1))&&(p190==1)) U (((p12==1)&&(p35==1))&&(p192==1))) * E((p159...275
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,25.8118,522028,1,0,757,3.42717e+06,652,400,6910,2.36016e+06,844
FORMULA MedleyA-PT-16-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 156 transition count 320
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 156 transition count 320
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 56 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 154 transition count 310
Applied a total of 60 rules in 8 ms. Remains 154 /180 variables (removed 26) and now considering 310/360 (removed 50) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 23:43:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:43:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 23:43:36] [INFO ] Invariant cache hit.
[2024-06-02 23:43:37] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:43:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:43:41] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:43:41] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:43:41] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:43:41] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:43:41] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:43:42] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:43:42] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:43:42] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-06-02 23:43:42] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:43:43] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:43:43] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:43:43] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:43:43] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:43:45] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:43:45] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:43:46] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:43:46] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:43:46] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:43:50] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-06-02 23:43:50] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:43:53] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:43:53] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/189 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 189 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:44:10] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:44:10] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 309/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:44:22] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 501 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 31/31 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 154/180 places, 310/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60564 ms. Remains : 154/180 places, 310/360 transitions.
[2024-06-02 23:44:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:44:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:44:37] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 23:44:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:44:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:44:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2475397499775534743.gal : 2 ms
[2024-06-02 23:44:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12767245665077586174.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2475397499775534743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12767245665077586174.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.53227e+06,1.53656,32956,2,8114,5,98783,6,0,928,125365,0
Converting to forward existential form...Done !
original formula: EX(A(E(EF((p111==1)) U (p75==1)) U AG(EF(((p73==1)&&(p131==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(E(TRUE U ((p73==1)&&(p131==1)))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U ((p73==1)...279
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...553
Detected timeout of ITS tools.
[2024-06-02 23:45:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:45:07] [INFO ] Applying decomposition
[2024-06-02 23:45:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17820333854331165470.txt' '-o' '/tmp/graph17820333854331165470.bin' '-w' '/tmp/graph17820333854331165470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17820333854331165470.bin' '-l' '-1' '-v' '-w' '/tmp/graph17820333854331165470.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:45:07] [INFO ] Decomposing Gal with order
[2024-06-02 23:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:45:07] [INFO ] Removed a total of 384 redundant transitions.
[2024-06-02 23:45:07] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 10 ms.
[2024-06-02 23:45:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13153231620888165216.gal : 4 ms
[2024-06-02 23:45:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7315620819641474586.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13153231620888165216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7315620819641474586.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,5.53227e+06,0.355411,10588,601,24,14729,329,646,19832,44,1131,0
Converting to forward existential form...Done !
original formula: EX(A(E(EF((i6.u36.p111==1)) U (i6.u23.p75==1)) U AG(EF(((i6.u21.p73==1)&&(i4.u41.p131==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(E(TRUE U ((i6.u21.p73==1)&&(i4.u41.p131==1)))))))))) * !(E(!(!(E(TRUE U !(E(TR...335
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t29, t57, t58, t83, t86, t90, t103, t116, t117, t159, t161, t167, t169, t176, t177,...740
(forward)formula 0,0,10.4316,279604,1,0,404326,329,3570,1.52587e+06,184,1131,666312
FORMULA MedleyA-PT-16-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
[2024-06-02 23:45:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:45:18] [INFO ] Flatten gal took : 11 ms
Total runtime 1037740 ms.
BK_STOP 1717371918262
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-16"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-16, 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 r576-smll-171734920100122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;