About the Execution of ITS-Tools for SimpleLoadBal-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5390.968 | 636896.00 | 732159.00 | 1673.90 | FFFTTFFTFTTFFFFF | 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.r378-smll-171683810900162.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 SimpleLoadBal-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810900162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K May 18 16:43 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 SimpleLoadBal-PT-10-CTLFireability-2024-00
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-01
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-02
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-03
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-04
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-05
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-06
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-07
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-08
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-09
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-10
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2024-11
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2023-12
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2023-13
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2023-14
FORMULA_NAME SimpleLoadBal-PT-10-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716959135222
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 05:05:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 05:05:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:05:37] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2024-05-29 05:05:37] [INFO ] Transformed 104 places.
[2024-05-29 05:05:37] [INFO ] Transformed 605 transitions.
[2024-05-29 05:05:37] [INFO ] Found NUPN structural information;
[2024-05-29 05:05:37] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2024-05-29 05:05:37] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 161 ms.
Support contains 68 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 605/605 transitions.
Applied a total of 0 rules in 33 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:05:38] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-05-29 05:05:38] [INFO ] Computed 29 invariants in 48 ms
[2024-05-29 05:05:38] [INFO ] Implicit Places using invariants in 425 ms returned [10, 11, 12, 13, 14, 17, 18, 19, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 481 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 605/605 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 94/104 places, 605/605 transitions.
Support contains 68 out of 94 places after structural reductions.
[2024-05-29 05:05:39] [INFO ] Flatten gal took : 162 ms
[2024-05-29 05:05:39] [INFO ] Flatten gal took : 84 ms
[2024-05-29 05:05:39] [INFO ] Input system was already deterministic with 605 transitions.
Reduction of identical properties reduced properties to check from 87 to 85
RANDOM walk for 40000 steps (8 resets) in 3760 ms. (10 steps per ms) remains 44/85 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
[2024-05-29 05:05:41] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 94 cols
[2024-05-29 05:05:41] [INFO ] Computed 19 invariants in 20 ms
[2024-05-29 05:05:41] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/52 constraints. Problems are: Problem set: 10 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 10 solved, 28 unsolved
Problem AtomicPropp71 is UNSAT
At refinement iteration 3 (OVERLAPS) 38/89 variables, 12/64 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 38/102 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/103 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 2/91 variables, 2/105 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 2/107 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 27 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 10 (OVERLAPS) 3/94 variables, 3/110 constraints. Problems are: Problem set: 32 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 3/113 constraints. Problems are: Problem set: 32 solved, 6 unsolved
[2024-05-29 05:05:43] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 18 ms to minimize.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 1/114 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/114 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 475/569 variables, 94/208 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 210/418 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/569 variables, 0/418 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/569 variables, 0/418 constraints. Problems are: Problem set: 34 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 418 constraints, problems are : Problem set: 34 solved, 4 unsolved in 1674 ms.
Refiners :[Domain max(s): 94/94 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 34 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 33/44 variables, 6/17 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 33/50 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/50 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/79 variables, 7/57 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 35/92 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/92 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/81 variables, 2/94 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 2/96 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/96 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/94 variables, 4/100 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 13/113 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 1/114 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 0/114 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 475/569 variables, 94/208 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/569 variables, 210/418 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 4/422 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/422 constraints. Problems are: Problem set: 34 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/569 variables, 0/422 constraints. Problems are: Problem set: 34 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 422 constraints, problems are : Problem set: 34 solved, 4 unsolved in 1483 ms.
Refiners :[Domain max(s): 94/94 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 4/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 3822ms problems are : Problem set: 34 solved, 4 unsolved
Parikh walk visited 0 properties in 1851 ms.
Support contains 11 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 94 transition count 597
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 86 transition count 597
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 36 place count 76 transition count 587
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 72 transition count 585
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 0 with 4 rules applied. Total rules applied 46 place count 70 transition count 583
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 70 transition count 574
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 64 place count 61 transition count 574
Applied a total of 64 rules in 170 ms. Remains 61 /94 variables (removed 33) and now considering 574/605 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 61/94 places, 574/605 transitions.
RANDOM walk for 40000 steps (8 resets) in 690 ms. (57 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
[2024-05-29 05:05:47] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
// Phase 1: matrix 444 rows 61 cols
[2024-05-29 05:05:47] [INFO ] Computed 17 invariants in 7 ms
[2024-05-29 05:05:47] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/14 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/52 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/61 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/61 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 444/505 variables, 61/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 210/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/505 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 396 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/14 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/52 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/61 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 05:05:48] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 5 ms to minimize.
[2024-05-29 05:05:48] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/61 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/61 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 444/505 variables, 61/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 210/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/505 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1268 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1716ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 779 ms.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 574/574 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 573
Applied a total of 2 rules in 90 ms. Remains 60 /61 variables (removed 1) and now considering 573/574 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 60/61 places, 573/574 transitions.
RANDOM walk for 40000 steps (8 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337510 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 337510 steps, saw 164535 distinct states, run finished after 3012 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-29 05:05:53] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
// Phase 1: matrix 443 rows 60 cols
[2024-05-29 05:05:53] [INFO ] Computed 17 invariants in 6 ms
[2024-05-29 05:05:53] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/50 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 443/503 variables, 60/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 210/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 343 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/50 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 05:05:54] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
[2024-05-29 05:05:54] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 443/503 variables, 60/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 210/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/503 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1391 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1789ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 990 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 573/573 transitions.
Applied a total of 0 rules in 30 ms. Remains 60 /60 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 60/60 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 573/573 transitions.
Applied a total of 0 rules in 27 ms. Remains 60 /60 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 05:05:56] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-05-29 05:05:56] [INFO ] Invariant cache hit.
[2024-05-29 05:05:56] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 05:05:56] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-05-29 05:05:56] [INFO ] Invariant cache hit.
[2024-05-29 05:05:56] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:05:57] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-29 05:05:57] [INFO ] Redundant transitions in 49 ms returned []
Running 563 sub problems to find dead transitions.
[2024-05-29 05:05:57] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-05-29 05:05:57] [INFO ] Invariant cache hit.
[2024-05-29 05:05:57] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/77 constraints. Problems are: Problem set: 192 solved, 371 unsolved
[2024-05-29 05:06:04] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
[2024-05-29 05:06:05] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2024-05-29 05:06:05] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-29 05:06:05] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 05:06:06] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-29 05:06:06] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-29 05:06:06] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 05:06:06] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2024-05-29 05:06:06] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 2 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-05-29 05:06:06] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-29 05:06:07] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 11/88 constraints. Problems are: Problem set: 218 solved, 345 unsolved
[2024-05-29 05:06:09] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 05:06:10] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2024-05-29 05:06:10] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-29 05:06:10] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2024-05-29 05:06:10] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2024-05-29 05:06:10] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/94 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/94 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 6 (OVERLAPS) 443/503 variables, 60/154 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 210/364 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/364 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 0/503 variables, 0/364 constraints. Problems are: Problem set: 221 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 364 constraints, problems are : Problem set: 221 solved, 342 unsolved in 29396 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 221 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 13/73 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/77 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 17/94 constraints. Problems are: Problem set: 221 solved, 342 unsolved
[2024-05-29 05:06:33] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/95 constraints. Problems are: Problem set: 221 solved, 342 unsolved
[2024-05-29 05:06:35] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/96 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/96 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 443/503 variables, 60/156 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 210/366 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 342/708 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/708 constraints. Problems are: Problem set: 221 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 708 constraints, problems are : Problem set: 221 solved, 342 unsolved in 30028 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 342/563 constraints, Known Traps: 19/19 constraints]
After SMT, in 63680ms problems are : Problem set: 221 solved, 342 unsolved
Search for dead transitions found 221 dead transitions in 63700ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/60 places, 352/573 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 350
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 348
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 55 transition count 346
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 54 transition count 344
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 19 ms. Remains 54 /60 variables (removed 6) and now considering 344/352 (removed 8) transitions.
[2024-05-29 05:07:01] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
// Phase 1: matrix 267 rows 54 cols
[2024-05-29 05:07:01] [INFO ] Computed 19 invariants in 4 ms
[2024-05-29 05:07:01] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 05:07:01] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2024-05-29 05:07:01] [INFO ] Invariant cache hit.
[2024-05-29 05:07:01] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:07:01] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 54/60 places, 344/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65404 ms. Remains : 54/60 places, 344/573 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 36 atomic propositions for a total of 16 simplifications.
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 05:07:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 05:07:01] [INFO ] Flatten gal took : 60 ms
FORMULA SimpleLoadBal-PT-10-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 05:07:01] [INFO ] Flatten gal took : 80 ms
[2024-05-29 05:07:02] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 51 out of 94 places (down from 55) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:07:02] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 94 cols
[2024-05-29 05:07:02] [INFO ] Computed 19 invariants in 7 ms
[2024-05-29 05:07:02] [INFO ] Implicit Places using invariants in 284 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 286 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:07:02] [INFO ] Flatten gal took : 34 ms
[2024-05-29 05:07:02] [INFO ] Flatten gal took : 35 ms
[2024-05-29 05:07:02] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:07:02] [INFO ] Flatten gal took : 30 ms
[2024-05-29 05:07:02] [INFO ] Flatten gal took : 30 ms
[2024-05-29 05:07:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3844585002579081506.gal : 30 ms
[2024-05-29 05:07:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2176972084529628919.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3844585002579081506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2176972084529628919.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:07:32] [INFO ] Flatten gal took : 29 ms
[2024-05-29 05:07:32] [INFO ] Applying decomposition
[2024-05-29 05:07:32] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12766971335200105699.txt' '-o' '/tmp/graph12766971335200105699.bin' '-w' '/tmp/graph12766971335200105699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12766971335200105699.bin' '-l' '-1' '-v' '-w' '/tmp/graph12766971335200105699.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:07:33] [INFO ] Decomposing Gal with order
[2024-05-29 05:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:07:33] [INFO ] Removed a total of 1721 redundant transitions.
[2024-05-29 05:07:33] [INFO ] Flatten gal took : 177 ms
[2024-05-29 05:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 32 ms.
[2024-05-29 05:07:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14623598783535614544.gal : 11 ms
[2024-05-29 05:07:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2487652772588002549.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/CTLFireability14623598783535614544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2487652772588002549.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,4.06034e+08,0.596146,17280,750,52,27083,221,743,26221,71,598,0
Converting to forward existential form...Done !
original formula: AG((AX(((((i6.u10.P_server_idle_1==0)||(i8.u15.P_server_request_2_1==0))&&(((i6.u12.P_server_notification_1==0)||(i13.u18.P_lb_idle_1==0)...380
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((EX(TRUE) * (((i4.u16.P_lb_routing_1_5==0)||(i13.u27.P_lb_load_1_3==0))||(i13.u27.P_lb...437
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...378
(forward)formula 0,0,1.09815,26772,1,0,46371,756,3742,47598,274,2389,154403
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 94 transition count 596
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 85 transition count 596
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 76 transition count 587
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 39 place count 74 transition count 586
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 0 with 2 rules applied. Total rules applied 41 place count 73 transition count 585
Applied a total of 41 rules in 49 ms. Remains 73 /94 variables (removed 21) and now considering 585/605 (removed 20) transitions.
[2024-05-29 05:07:34] [INFO ] Flow matrix only has 455 transitions (discarded 130 similar events)
// Phase 1: matrix 455 rows 73 cols
[2024-05-29 05:07:34] [INFO ] Computed 18 invariants in 5 ms
[2024-05-29 05:07:34] [INFO ] Implicit Places using invariants in 179 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/94 places, 585/605 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 584
Applied a total of 2 rules in 53 ms. Remains 71 /72 variables (removed 1) and now considering 584/585 (removed 1) transitions.
[2024-05-29 05:07:34] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
// Phase 1: matrix 454 rows 71 cols
[2024-05-29 05:07:34] [INFO ] Computed 17 invariants in 7 ms
[2024-05-29 05:07:35] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-29 05:07:35] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
[2024-05-29 05:07:35] [INFO ] Invariant cache hit.
[2024-05-29 05:07:35] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:07:35] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 71/94 places, 584/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1343 ms. Remains : 71/94 places, 584/605 transitions.
[2024-05-29 05:07:35] [INFO ] Flatten gal took : 53 ms
[2024-05-29 05:07:36] [INFO ] Flatten gal took : 54 ms
[2024-05-29 05:07:36] [INFO ] Input system was already deterministic with 584 transitions.
[2024-05-29 05:07:36] [INFO ] Flatten gal took : 58 ms
[2024-05-29 05:07:36] [INFO ] Flatten gal took : 53 ms
[2024-05-29 05:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10092792676509669042.gal : 8 ms
[2024-05-29 05:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5711764376174145261.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/CTLFireability10092792676509669042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5711764376174145261.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:08:06] [INFO ] Flatten gal took : 33 ms
[2024-05-29 05:08:06] [INFO ] Applying decomposition
[2024-05-29 05:08:06] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9742431214487856079.txt' '-o' '/tmp/graph9742431214487856079.bin' '-w' '/tmp/graph9742431214487856079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9742431214487856079.bin' '-l' '-1' '-v' '-w' '/tmp/graph9742431214487856079.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:08:06] [INFO ] Decomposing Gal with order
[2024-05-29 05:08:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:08:06] [INFO ] Removed a total of 1782 redundant transitions.
[2024-05-29 05:08:06] [INFO ] Flatten gal took : 86 ms
[2024-05-29 05:08:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 24 ms.
[2024-05-29 05:08:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1093900311533687154.gal : 6 ms
[2024-05-29 05:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10301159321351094077.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/CTLFireability1093900311533687154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10301159321351094077.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,1.44506e+06,0.514873,10196,734,52,10540,193,855,14125,79,514,0
Converting to forward existential form...Done !
original formula: E((((u8.P_server_request_1_2==1)&&(i13.u14.P_lb_balancing_1==1))&&((i13.u18.P_lb_load_1_3==1)&&(i8.u19.P_lb_load_2_5==1))) U AG(A(!((((u1...546
=> equivalent forward existential formula: [(FwdU(Init,(((u8.P_server_request_1_2==1)&&(i13.u14.P_lb_balancing_1==1))&&((i13.u18.P_lb_load_1_3==1)&&(i8.u19...1245
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t325, t379, t380, t381, t382, t383, t384, t385, t386, t387, t388, t526, t527, t528, t...394
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,1.53569,35540,1,0,61819,645,4184,71444,300,2348,161489
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 94 transition count 597
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 86 transition count 597
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 34 place count 77 transition count 588
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 73 transition count 586
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 0 with 4 rules applied. Total rules applied 44 place count 71 transition count 584
Applied a total of 44 rules in 53 ms. Remains 71 /94 variables (removed 23) and now considering 584/605 (removed 21) transitions.
[2024-05-29 05:08:08] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
// Phase 1: matrix 454 rows 71 cols
[2024-05-29 05:08:08] [INFO ] Computed 17 invariants in 5 ms
[2024-05-29 05:08:08] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-29 05:08:08] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
[2024-05-29 05:08:08] [INFO ] Invariant cache hit.
[2024-05-29 05:08:08] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:08:09] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-29 05:08:09] [INFO ] Redundant transitions in 6 ms returned []
Running 574 sub problems to find dead transitions.
[2024-05-29 05:08:09] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
[2024-05-29 05:08:09] [INFO ] Invariant cache hit.
[2024-05-29 05:08:09] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (OVERLAPS) 9/70 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/71 variables, 3/87 constraints. Problems are: Problem set: 192 solved, 382 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/88 constraints. Problems are: Problem set: 192 solved, 382 unsolved
[2024-05-29 05:08:24] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
[2024-05-29 05:08:25] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2024-05-29 05:08:25] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 10 ms to minimize.
[2024-05-29 05:08:25] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 2 ms to minimize.
[2024-05-29 05:08:25] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 6 ms to minimize.
[2024-05-29 05:08:26] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 2 ms to minimize.
[2024-05-29 05:08:26] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2024-05-29 05:08:26] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2024-05-29 05:08:26] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 2 ms to minimize.
[2024-05-29 05:08:26] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 7 ms to minimize.
[2024-05-29 05:08:27] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2024-05-29 05:08:27] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-05-29 05:08:27] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2024-05-29 05:08:27] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 2 ms to minimize.
Problem TDEAD558 is UNSAT
[2024-05-29 05:08:28] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 3 ms to minimize.
[2024-05-29 05:08:28] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 2 ms to minimize.
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
[2024-05-29 05:08:28] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 17/105 constraints. Problems are: Problem set: 221 solved, 353 unsolved
[2024-05-29 05:08:30] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2024-05-29 05:08:30] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 2/107 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/107 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 12 (OVERLAPS) 454/525 variables, 71/178 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 210/388 constraints. Problems are: Problem set: 221 solved, 353 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 525/525 variables, and 388 constraints, problems are : Problem set: 221 solved, 353 unsolved in 30032 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 221 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/65 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/66 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 12/78 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/78 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 9/70 variables, 9/87 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 9/96 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 4/100 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/100 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 9 (OVERLAPS) 1/71 variables, 3/103 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/104 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 3/107 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/107 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 13 (OVERLAPS) 454/525 variables, 71/178 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 210/388 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 353/741 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/741 constraints. Problems are: Problem set: 221 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 741 constraints, problems are : Problem set: 221 solved, 353 unsolved in 30018 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 353/574 constraints, Known Traps: 19/19 constraints]
After SMT, in 62493ms problems are : Problem set: 221 solved, 353 unsolved
Search for dead transitions found 221 dead transitions in 62505ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 71/94 places, 363/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 359
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 66 transition count 357
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 65 transition count 355
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 4 rules in 21 ms. Remains 65 /71 variables (removed 6) and now considering 355/363 (removed 8) transitions.
[2024-05-29 05:09:11] [INFO ] Flow matrix only has 278 transitions (discarded 77 similar events)
// Phase 1: matrix 278 rows 65 cols
[2024-05-29 05:09:11] [INFO ] Computed 19 invariants in 4 ms
[2024-05-29 05:09:11] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 05:09:11] [INFO ] Flow matrix only has 278 transitions (discarded 77 similar events)
[2024-05-29 05:09:11] [INFO ] Invariant cache hit.
[2024-05-29 05:09:12] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:09:12] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 65/94 places, 355/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64014 ms. Remains : 65/94 places, 355/605 transitions.
[2024-05-29 05:09:12] [INFO ] Found a total of 2 fixed domain variables (out of 65 variables) in GAL type petri
[2024-05-29 05:09:12] [INFO ] Found a total of 2 constant array cells/variables (out of 65 variables) in type petri
[2024-05-29 05:09:12] [INFO ] P_lb_load_1_9,P_lb_load_2_7,
[2024-05-29 05:09:12] [INFO ] Removed 2 constant variables :P_lb_load_1_9=0, P_lb_load_2_7=0
[2024-05-29 05:09:12] [INFO ] Simplified 2 expressions due to constant valuations.
[2024-05-29 05:09:12] [INFO ] Flatten gal took : 66 ms
[2024-05-29 05:09:12] [INFO ] Flatten gal took : 18 ms
[2024-05-29 05:09:12] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 3 out of 63 places (down from 7) after GAL structural reductions.
[2024-05-29 05:09:12] [INFO ] Flatten gal took : 18 ms
[2024-05-29 05:09:12] [INFO ] Flatten gal took : 18 ms
[2024-05-29 05:09:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14959226971877842491.gal : 3 ms
[2024-05-29 05:09:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1832622803344650058.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/CTLFireability14959226971877842491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1832622803344650058.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,1.44506e+06,8.22746,157044,2,27038,5,425740,6,0,610,245806,0
Converting to forward existential form...Done !
original formula: AF(!(E(((P_client_request_4==1)&&(P_lb_idle_1==1)) U EG((P_client_idle_1==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((P_client_request_4==1)&&(P_lb_idle_1==1)) U EG((P_client_idle_1==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t206, t247, t248, t249, t250, t251, t252, t253, t254, t255, t256, t313, t314, t315, t...434
Detected timeout of ITS tools.
[2024-05-29 05:09:42] [INFO ] Flatten gal took : 19 ms
[2024-05-29 05:09:42] [INFO ] Applying decomposition
[2024-05-29 05:09:42] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3294308500318292832.txt' '-o' '/tmp/graph3294308500318292832.bin' '-w' '/tmp/graph3294308500318292832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3294308500318292832.bin' '-l' '-1' '-v' '-w' '/tmp/graph3294308500318292832.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:09:42] [INFO ] Decomposing Gal with order
[2024-05-29 05:09:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:09:42] [INFO ] Removed a total of 704 redundant transitions.
[2024-05-29 05:09:42] [INFO ] Flatten gal took : 44 ms
[2024-05-29 05:09:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 6 ms.
[2024-05-29 05:09:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15159132955126136532.gal : 3 ms
[2024-05-29 05:09:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13647172943603619352.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/CTLFireability15159132955126136532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13647172943603619352.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44506e+06,0.097872,6744,779,198,6066,575,391,5163,140,2553,0
Converting to forward existential form...Done !
original formula: AF(!(E(((i0.u0.P_client_request_4==1)&&(u14.P_lb_idle_1==1)) U EG((i3.u1.P_client_idle_1==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((i0.u0.P_client_request_4==1)&&(u14.P_lb_idle_1==1)) U EG((i3.u1.P_client_idle_1==1))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t206, t247, t248, t249, t250, t251, t252, t253, t254, t255, t256, t313, t314, t315, t...380
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,0.65991,26280,1,0,49473,2035,1979,50058,735,7645,132303
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:09:43] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 94 cols
[2024-05-29 05:09:43] [INFO ] Computed 19 invariants in 11 ms
[2024-05-29 05:09:43] [INFO ] Implicit Places using invariants in 310 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:09:43] [INFO ] Flatten gal took : 22 ms
[2024-05-29 05:09:43] [INFO ] Flatten gal took : 25 ms
[2024-05-29 05:09:43] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:09:43] [INFO ] Flatten gal took : 25 ms
[2024-05-29 05:09:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 05:09:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12806328103813513946.gal : 9 ms
[2024-05-29 05:09:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6779401375605934646.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/CTLFireability12806328103813513946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6779401375605934646.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:10:14] [INFO ] Flatten gal took : 25 ms
[2024-05-29 05:10:14] [INFO ] Applying decomposition
[2024-05-29 05:10:14] [INFO ] Flatten gal took : 25 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/graph10184002807244078074.txt' '-o' '/tmp/graph10184002807244078074.bin' '-w' '/tmp/graph10184002807244078074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10184002807244078074.bin' '-l' '-1' '-v' '-w' '/tmp/graph10184002807244078074.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:10:14] [INFO ] Decomposing Gal with order
[2024-05-29 05:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:10:14] [INFO ] Removed a total of 1483 redundant transitions.
[2024-05-29 05:10:14] [INFO ] Flatten gal took : 63 ms
[2024-05-29 05:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 19 ms.
[2024-05-29 05:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12077090345889243247.gal : 4 ms
[2024-05-29 05:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12292402059413284437.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/CTLFireability12077090345889243247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12292402059413284437.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.06034e+08,0.433079,15112,773,191,23518,623,704,22943,146,2633,0
Converting to forward existential form...Done !
original formula: AG((EG(EF((((i13.u24.P_server_request_10_1==1)&&(u22.P_lb_balancing_1==1))&&((u22.P_lb_load_1_2==1)&&(u22.P_lb_load_2_0==1))))) + AF(AX((...242
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(E(TRUE U (((i13.u24.P_server_request_10_1==1)&&(u22.P_lb_balancing_1==1))&&((u22.P...309
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,1.2851,35176,1,0,69647,2521,3973,65484,742,9778,182443
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 94 transition count 596
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 85 transition count 596
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 75 transition count 586
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 73 transition count 585
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 0 with 2 rules applied. Total rules applied 43 place count 72 transition count 584
Applied a total of 43 rules in 59 ms. Remains 72 /94 variables (removed 22) and now considering 584/605 (removed 21) transitions.
[2024-05-29 05:10:15] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
// Phase 1: matrix 454 rows 72 cols
[2024-05-29 05:10:15] [INFO ] Computed 18 invariants in 9 ms
[2024-05-29 05:10:15] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-29 05:10:15] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
[2024-05-29 05:10:15] [INFO ] Invariant cache hit.
[2024-05-29 05:10:16] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:10:16] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-05-29 05:10:16] [INFO ] Redundant transitions in 4 ms returned []
Running 574 sub problems to find dead transitions.
[2024-05-29 05:10:16] [INFO ] Flow matrix only has 454 transitions (discarded 130 similar events)
[2024-05-29 05:10:16] [INFO ] Invariant cache hit.
[2024-05-29 05:10:16] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-29 05:10:23] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
[2024-05-29 05:10:24] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 2 ms to minimize.
[2024-05-29 05:10:24] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 2 ms to minimize.
[2024-05-29 05:10:25] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 2 ms to minimize.
[2024-05-29 05:10:25] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2024-05-29 05:10:25] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2024-05-29 05:10:25] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 7/74 constraints. Problems are: Problem set: 1 solved, 573 unsolved
[2024-05-29 05:10:30] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 573 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 573 unsolved
At refinement iteration 6 (OVERLAPS) 10/72 variables, 11/86 constraints. Problems are: Problem set: 1 solved, 573 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 10/96 constraints. Problems are: Problem set: 1 solved, 573 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/98 constraints. Problems are: Problem set: 194 solved, 380 unsolved
[2024-05-29 05:10:36] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 2 ms to minimize.
Problem TDEAD325 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
[2024-05-29 05:10:37] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-05-29 05:10:37] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2024-05-29 05:10:38] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
[2024-05-29 05:10:38] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 2 ms to minimize.
[2024-05-29 05:10:38] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
Problem TDEAD551 is UNSAT
[2024-05-29 05:10:38] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 2 ms to minimize.
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
[2024-05-29 05:10:38] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
[2024-05-29 05:10:39] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 9/107 constraints. Problems are: Problem set: 221 solved, 353 unsolved
[2024-05-29 05:10:42] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 1 ms to minimize.
[2024-05-29 05:10:42] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2024-05-29 05:10:43] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 2 ms to minimize.
[2024-05-29 05:10:43] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 4/111 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/111 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 12 (OVERLAPS) 454/526 variables, 72/183 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 210/393 constraints. Problems are: Problem set: 221 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 393 constraints, problems are : Problem set: 221 solved, 353 unsolved in 30016 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 221 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/65 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/67 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 15/82 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/82 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 11/93 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/103 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 2/105 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 6/111 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/111 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 10 (OVERLAPS) 454/526 variables, 72/183 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 210/393 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 353/746 constraints. Problems are: Problem set: 221 solved, 353 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/746 constraints. Problems are: Problem set: 221 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 746 constraints, problems are : Problem set: 221 solved, 353 unsolved in 30018 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 353/574 constraints, Known Traps: 21/21 constraints]
After SMT, in 62804ms problems are : Problem set: 221 solved, 353 unsolved
Search for dead transitions found 221 dead transitions in 62813ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 72/94 places, 363/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 359
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 66 transition count 357
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 64 transition count 355
Applied a total of 6 rules in 16 ms. Remains 64 /72 variables (removed 8) and now considering 355/363 (removed 8) transitions.
[2024-05-29 05:11:19] [INFO ] Flow matrix only has 278 transitions (discarded 77 similar events)
// Phase 1: matrix 278 rows 64 cols
[2024-05-29 05:11:19] [INFO ] Computed 18 invariants in 2 ms
[2024-05-29 05:11:19] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-29 05:11:19] [INFO ] Flow matrix only has 278 transitions (discarded 77 similar events)
[2024-05-29 05:11:19] [INFO ] Invariant cache hit.
[2024-05-29 05:11:19] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:11:20] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/94 places, 355/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64624 ms. Remains : 64/94 places, 355/605 transitions.
[2024-05-29 05:11:20] [INFO ] Flatten gal took : 14 ms
[2024-05-29 05:11:20] [INFO ] Flatten gal took : 26 ms
[2024-05-29 05:11:20] [INFO ] Input system was already deterministic with 355 transitions.
[2024-05-29 05:11:20] [INFO ] Flatten gal took : 34 ms
[2024-05-29 05:11:20] [INFO ] Flatten gal took : 51 ms
[2024-05-29 05:11:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15199297955168512866.gal : 4 ms
[2024-05-29 05:11:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13931845218915517323.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/CTLFireability15199297955168512866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13931845218915517323.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,1.62773e+06,9.75223,187940,2,26314,5,458406,6,0,614,310770,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 05:11:50] [INFO ] Flatten gal took : 16 ms
[2024-05-29 05:11:50] [INFO ] Applying decomposition
[2024-05-29 05:11:50] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15210217310749628878.txt' '-o' '/tmp/graph15210217310749628878.bin' '-w' '/tmp/graph15210217310749628878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15210217310749628878.bin' '-l' '-1' '-v' '-w' '/tmp/graph15210217310749628878.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:11:50] [INFO ] Decomposing Gal with order
[2024-05-29 05:11:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:11:50] [INFO ] Removed a total of 703 redundant transitions.
[2024-05-29 05:11:50] [INFO ] Flatten gal took : 29 ms
[2024-05-29 05:11:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 4 ms.
[2024-05-29 05:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1664709105116742727.gal : 2 ms
[2024-05-29 05:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8321289560070026984.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/CTLFireability1664709105116742727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8321289560070026984.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62773e+06,0.198328,10420,924,199,11077,581,383,8932,144,2782,0
Converting to forward existential form...Done !
original formula: EF(((A(((i0.u0.P_client_waiting_7==1)&&(i0.u0.P_client_ack_7==1)) U (((u2.P_server_notification_2==1)&&(u9.P_lb_idle_1==1))&&(u9.P_lb_loa...468
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((((u11.P_lb_routing_1_3==1)&&(u9.P_lb_load_1_2==1))&&(u9.P_lb_load_2_2==1))||(((u11.P_se...741
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t200, t245, t246, t247, t248, t249, t250, t251, t252, t253, t254, t313, t314, t315, t...380
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,0.751278,25996,1,0,43684,2864,2115,38570,785,10075,166198
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-04 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 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:11:51] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 94 cols
[2024-05-29 05:11:51] [INFO ] Computed 19 invariants in 4 ms
[2024-05-29 05:11:51] [INFO ] Implicit Places using invariants in 200 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 201 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:11:51] [INFO ] Flatten gal took : 49 ms
[2024-05-29 05:11:51] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:11:51] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:11:51] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:11:51] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:11:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9308265849618158965.gal : 4 ms
[2024-05-29 05:11:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7938521346290011911.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/CTLFireability9308265849618158965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7938521346290011911.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:12:21] [INFO ] Flatten gal took : 25 ms
[2024-05-29 05:12:21] [INFO ] Applying decomposition
[2024-05-29 05:12:21] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6868446048039247568.txt' '-o' '/tmp/graph6868446048039247568.bin' '-w' '/tmp/graph6868446048039247568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6868446048039247568.bin' '-l' '-1' '-v' '-w' '/tmp/graph6868446048039247568.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:12:22] [INFO ] Decomposing Gal with order
[2024-05-29 05:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:12:22] [INFO ] Removed a total of 1721 redundant transitions.
[2024-05-29 05:12:22] [INFO ] Flatten gal took : 54 ms
[2024-05-29 05:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 9 ms.
[2024-05-29 05:12:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15746916729262401495.gal : 5 ms
[2024-05-29 05:12:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3962945883706460984.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/CTLFireability15746916729262401495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3962945883706460984.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,4.06034e+08,0.545558,15468,747,52,24508,213,743,23191,73,597,0
Converting to forward existential form...Done !
original formula: AF((((EX((((i2.u22.P_server_request_6_1==1)&&(i11.u20.P_lb_balancing_1==1))&&((i11.u27.P_lb_load_1_3==1)&&(i11.u26.P_lb_load_2_1==1)))) *...284
=> equivalent forward existential formula: [FwdG(Init,!((((EX((((i2.u22.P_server_request_6_1==1)&&(i11.u20.P_lb_balancing_1==1))&&((i11.u27.P_lb_load_1_3==...329
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...378
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,1.6081,37380,1,0,70598,717,3775,67832,276,2380,228298
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:12:23] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:12:23] [INFO ] Invariant cache hit.
[2024-05-29 05:12:23] [INFO ] Implicit Places using invariants in 205 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 206 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:12:24] [INFO ] Flatten gal took : 20 ms
[2024-05-29 05:12:24] [INFO ] Flatten gal took : 24 ms
[2024-05-29 05:12:24] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:12:24] [INFO ] Flatten gal took : 22 ms
[2024-05-29 05:12:24] [INFO ] Flatten gal took : 26 ms
[2024-05-29 05:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14643465111318602393.gal : 8 ms
[2024-05-29 05:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability60696325912924559.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/CTLFireability14643465111318602393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability60696325912924559.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:12:54] [INFO ] Flatten gal took : 25 ms
[2024-05-29 05:12:54] [INFO ] Applying decomposition
[2024-05-29 05:12:54] [INFO ] Flatten gal took : 25 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/graph1605535819710338460.txt' '-o' '/tmp/graph1605535819710338460.bin' '-w' '/tmp/graph1605535819710338460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1605535819710338460.bin' '-l' '-1' '-v' '-w' '/tmp/graph1605535819710338460.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:12:54] [INFO ] Decomposing Gal with order
[2024-05-29 05:12:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:12:54] [INFO ] Removed a total of 1721 redundant transitions.
[2024-05-29 05:12:54] [INFO ] Flatten gal took : 68 ms
[2024-05-29 05:12:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 12 ms.
[2024-05-29 05:12:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2217908114738743191.gal : 6 ms
[2024-05-29 05:12:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6933933109638860050.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/CTLFireability2217908114738743191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6933933109638860050.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,4.06034e+08,0.677725,14600,770,54,22696,193,695,22136,98,348,0
Converting to forward existential form...Done !
original formula: A(EX(AG((EG((((i2.u14.P_server_request_1_2==1)&&(i12.u19.P_lb_balancing_1==1))&&((i12.u25.P_lb_load_1_2==1)&&(i12.u26.P_lb_load_2_4==1)))...517
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!(!(E(TRUE U !((((i9.u16.P_lb_routing_1_6==1)&&(u27.P_lb_load_1_5==1))&&(u27.P_lb_load_2_5=...1098
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...378
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.04935,82976,1,0,184913,542,3915,142632,335,1454,473180
FORMULA SimpleLoadBal-PT-10-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 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:12:57] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:12:57] [INFO ] Invariant cache hit.
[2024-05-29 05:12:57] [INFO ] Implicit Places using invariants in 345 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 346 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:12:57] [INFO ] Flatten gal took : 34 ms
[2024-05-29 05:12:58] [INFO ] Flatten gal took : 37 ms
[2024-05-29 05:12:58] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:12:58] [INFO ] Flatten gal took : 35 ms
[2024-05-29 05:12:58] [INFO ] Flatten gal took : 36 ms
[2024-05-29 05:12:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10848657684078121835.gal : 7 ms
[2024-05-29 05:12:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15170455027101207246.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/CTLFireability10848657684078121835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15170455027101207246.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:13:28] [INFO ] Flatten gal took : 20 ms
[2024-05-29 05:13:28] [INFO ] Applying decomposition
[2024-05-29 05:13:28] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11267076868466532694.txt' '-o' '/tmp/graph11267076868466532694.bin' '-w' '/tmp/graph11267076868466532694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11267076868466532694.bin' '-l' '-1' '-v' '-w' '/tmp/graph11267076868466532694.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:13:28] [INFO ] Decomposing Gal with order
[2024-05-29 05:13:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:13:28] [INFO ] Removed a total of 1483 redundant transitions.
[2024-05-29 05:13:28] [INFO ] Flatten gal took : 42 ms
[2024-05-29 05:13:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 8 ms.
[2024-05-29 05:13:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3138312556203195035.gal : 4 ms
[2024-05-29 05:13:28] [INFO ] Time to serialize properties into /tmp/CTLFireability637136655517167826.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/CTLFireability3138312556203195035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability637136655517167826.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.06034e+08,0.812627,16604,779,191,27167,616,702,26448,144,2783,0
Converting to forward existential form...Done !
original formula: EG(((EG((((i1.u22.P_lb_routing_1_6==0)||(i13.u25.P_lb_load_1_5==0))||(i13.u25.P_lb_load_2_5==0))) * AX(FALSE)) * EF(AX(((i5.u11.P_server_...205
=> equivalent forward existential formula: [FwdG(Init,((EG((((i1.u22.P_lb_routing_1_6==0)||(i13.u25.P_lb_load_1_5==0))||(i13.u25.P_lb_load_2_5==0))) * !(EX...266
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,1.58545,31388,1,0,61394,2471,3882,59224,731,9469,157962
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:13:30] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:13:30] [INFO ] Invariant cache hit.
[2024-05-29 05:13:30] [INFO ] Implicit Places using invariants in 256 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 265 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:13:30] [INFO ] Flatten gal took : 20 ms
[2024-05-29 05:13:30] [INFO ] Flatten gal took : 20 ms
[2024-05-29 05:13:30] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:13:30] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:13:30] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:13:30] [INFO ] Time to serialize gal into /tmp/CTLFireability809124381131727761.gal : 4 ms
[2024-05-29 05:13:30] [INFO ] Time to serialize properties into /tmp/CTLFireability72818377084256916.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/CTLFireability809124381131727761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability72818377084256916.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 -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:14:00] [INFO ] Flatten gal took : 20 ms
[2024-05-29 05:14:00] [INFO ] Applying decomposition
[2024-05-29 05:14:00] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16261363163012393270.txt' '-o' '/tmp/graph16261363163012393270.bin' '-w' '/tmp/graph16261363163012393270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16261363163012393270.bin' '-l' '-1' '-v' '-w' '/tmp/graph16261363163012393270.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:14:00] [INFO ] Decomposing Gal with order
[2024-05-29 05:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:14:00] [INFO ] Removed a total of 1721 redundant transitions.
[2024-05-29 05:14:00] [INFO ] Flatten gal took : 40 ms
[2024-05-29 05:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 7 ms.
[2024-05-29 05:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13194914562691784540.gal : 3 ms
[2024-05-29 05:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8905824540289992121.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/CTLFireability13194914562691784540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8905824540289992121.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,4.06034e+08,0.553599,19404,809,52,34488,235,723,37391,75,677,0
Converting to forward existential form...Done !
original formula: !(E((EF((EX((((i1.u20.P_lb_routing_1_2==1)&&(u28.P_lb_load_1_6==1))&&(u28.P_lb_load_2_5==1))) * ((((i8.u21.P_lb_routing_1_3==1)&&(u28.P_l...857
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,(E(TRUE U (EX((((i1.u20.P_lb_routing_1_2==1)&&(u28.P_lb_load_1_6==1))&&(u28.P_lb_load_2_5==1))...905
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39...381
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,1.30916,36564,1,0,81354,557,3751,69443,295,1477,171301
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:14:02] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:14:02] [INFO ] Invariant cache hit.
[2024-05-29 05:14:02] [INFO ] Implicit Places using invariants in 336 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 338 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:14:02] [INFO ] Flatten gal took : 18 ms
[2024-05-29 05:14:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:14:02] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:14:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:14:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:14:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5244839395040029969.gal : 7 ms
[2024-05-29 05:14:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13649134844284761856.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/CTLFireability5244839395040029969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13649134844284761856.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:14:32] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:14:32] [INFO ] Applying decomposition
[2024-05-29 05:14:32] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11440176273441344942.txt' '-o' '/tmp/graph11440176273441344942.bin' '-w' '/tmp/graph11440176273441344942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11440176273441344942.bin' '-l' '-1' '-v' '-w' '/tmp/graph11440176273441344942.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:14:32] [INFO ] Decomposing Gal with order
[2024-05-29 05:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:14:32] [INFO ] Removed a total of 1721 redundant transitions.
[2024-05-29 05:14:32] [INFO ] Flatten gal took : 41 ms
[2024-05-29 05:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 7 ms.
[2024-05-29 05:14:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11050946476944558422.gal : 3 ms
[2024-05-29 05:14:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15897554125977097844.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/CTLFireability11050946476944558422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15897554125977097844.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.06034e+08,1.10689,23892,899,52,41976,215,777,39319,75,522,0
Converting to forward existential form...Done !
original formula: (EF(AX(FALSE)) * AF(EX((((i9.u19.P_lb_routing_1_2!=1)||(i6.u17.P_lb_load_1_0!=1))||(i6.u17.P_lb_load_2_0!=1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(FALSE))))))] = FALSE * [FwdG(Init,!(EX((((i9.u19.P_lb_routing_1_2!=1)||(i6.u17.P_lb_...209
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...393
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,2.01298,39996,1,0,79447,871,4385,73925,284,4396,229870
FORMULA SimpleLoadBal-PT-10-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:14:34] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:14:34] [INFO ] Invariant cache hit.
[2024-05-29 05:14:35] [INFO ] Implicit Places using invariants in 243 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 244 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 92/94 places, 605/605 transitions.
[2024-05-29 05:14:35] [INFO ] Flatten gal took : 19 ms
[2024-05-29 05:14:35] [INFO ] Flatten gal took : 24 ms
[2024-05-29 05:14:35] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 05:14:35] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:14:35] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:14:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12812138361931469280.gal : 4 ms
[2024-05-29 05:14:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9155305760398975120.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/CTLFireability12812138361931469280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9155305760398975120.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 05:15:05] [INFO ] Flatten gal took : 39 ms
[2024-05-29 05:15:05] [INFO ] Applying decomposition
[2024-05-29 05:15:05] [INFO ] Flatten gal took : 36 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/graph2567034117239079753.txt' '-o' '/tmp/graph2567034117239079753.bin' '-w' '/tmp/graph2567034117239079753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2567034117239079753.bin' '-l' '-1' '-v' '-w' '/tmp/graph2567034117239079753.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:15:05] [INFO ] Decomposing Gal with order
[2024-05-29 05:15:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:15:05] [INFO ] Removed a total of 1790 redundant transitions.
[2024-05-29 05:15:05] [INFO ] Flatten gal took : 70 ms
[2024-05-29 05:15:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 13 ms.
[2024-05-29 05:15:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15523105071337970453.gal : 5 ms
[2024-05-29 05:15:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8133220079578968509.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/CTLFireability15523105071337970453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8133220079578968509.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,4.06034e+08,0.600913,18568,793,52,31522,205,823,33682,73,450,0
Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...378
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,1.8647,45496,1,0,94498,449,4475,96546,279,1125,238573
FORMULA SimpleLoadBal-PT-10-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 94 transition count 595
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 84 transition count 595
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 74 transition count 585
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 70 transition count 583
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 0 with 4 rules applied. Total rules applied 50 place count 68 transition count 581
Applied a total of 50 rules in 56 ms. Remains 68 /94 variables (removed 26) and now considering 581/605 (removed 24) transitions.
[2024-05-29 05:15:07] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-05-29 05:15:07] [INFO ] Computed 17 invariants in 3 ms
[2024-05-29 05:15:07] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-29 05:15:07] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-29 05:15:07] [INFO ] Invariant cache hit.
[2024-05-29 05:15:08] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:15:08] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2024-05-29 05:15:08] [INFO ] Redundant transitions in 6 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-29 05:15:08] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-29 05:15:08] [INFO ] Invariant cache hit.
[2024-05-29 05:15:08] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
[2024-05-29 05:15:22] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 2 ms to minimize.
[2024-05-29 05:15:22] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 2 ms to minimize.
[2024-05-29 05:15:22] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-05-29 05:15:23] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
Problem TDEAD551 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 4/87 constraints. Problems are: Problem set: 179 solved, 392 unsolved
[2024-05-29 05:15:25] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
[2024-05-29 05:15:25] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 2 ms to minimize.
Problem TDEAD549 is UNSAT
[2024-05-29 05:15:25] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 5 ms to minimize.
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 3/90 constraints. Problems are: Problem set: 184 solved, 387 unsolved
[2024-05-29 05:15:28] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2024-05-29 05:15:28] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 2 ms to minimize.
[2024-05-29 05:15:28] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2024-05-29 05:15:28] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 1 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 2 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 8/98 constraints. Problems are: Problem set: 184 solved, 387 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/98 constraints. Problems are: Problem set: 184 solved, 387 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD572 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/68 variables, 1/99 constraints. Problems are: Problem set: 200 solved, 371 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 1/100 constraints. Problems are: Problem set: 200 solved, 371 unsolved
[2024-05-29 05:15:36] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
[2024-05-29 05:15:37] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 3 ms to minimize.
[2024-05-29 05:15:37] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 3/103 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:15:39] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-05-29 05:15:39] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 2/105 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/519 variables, and 105 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30020 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/68 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 221 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 9/67 variables, 9/84 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 9/93 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 2/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 4/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 1/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 4/105 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/105 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 14 (OVERLAPS) 451/519 variables, 68/173 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 210/383 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 350/733 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 0/733 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 733 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30017 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 350/571 constraints, Known Traps: 20/20 constraints]
After SMT, in 62283ms problems are : Problem set: 221 solved, 350 unsolved
Search for dead transitions found 221 dead transitions in 62295ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 68/94 places, 360/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 356
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 354
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 61 transition count 352
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 16 ms. Remains 61 /68 variables (removed 7) and now considering 352/360 (removed 8) transitions.
[2024-05-29 05:16:11] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
// Phase 1: matrix 275 rows 61 cols
[2024-05-29 05:16:11] [INFO ] Computed 18 invariants in 4 ms
[2024-05-29 05:16:11] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-29 05:16:11] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-29 05:16:11] [INFO ] Invariant cache hit.
[2024-05-29 05:16:11] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:16:11] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/94 places, 352/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64411 ms. Remains : 61/94 places, 352/605 transitions.
[2024-05-29 05:16:11] [INFO ] Found a total of 1 fixed domain variables (out of 61 variables) in GAL type petri
[2024-05-29 05:16:11] [INFO ] Found a total of 1 constant array cells/variables (out of 61 variables) in type petri
[2024-05-29 05:16:11] [INFO ] P_lb_load_1_7,
[2024-05-29 05:16:11] [INFO ] Removed 1 constant variables :P_lb_load_1_7=0
[2024-05-29 05:16:11] [INFO ] Simplified 1 expressions due to constant valuations.
[2024-05-29 05:16:11] [INFO ] Flatten gal took : 24 ms
[2024-05-29 05:16:11] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:16:11] [INFO ] Input system was already deterministic with 352 transitions.
Support contains 3 out of 60 places (down from 7) after GAL structural reductions.
RANDOM walk for 3198 steps (0 resets) in 36 ms. (86 steps per ms) remains 0/1 properties
FORMULA SimpleLoadBal-PT-10-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 05:16:11] [INFO ] Flatten gal took : 24 ms
[2024-05-29 05:16:11] [INFO ] Flatten gal took : 24 ms
[2024-05-29 05:16:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5313043196045046242.gal : 4 ms
[2024-05-29 05:16:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2141380831675705317.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/ReachabilityCardinality5313043196045046242.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2141380831675705317.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 05:16:11] [INFO ] Flatten gal took : 21 ms
[2024-05-29 05:16:12] [INFO ] Flatten gal took : 20 ms
Total runtime 634584 ms.
BK_STOP 1716959772118
--------------------
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="SimpleLoadBal-PT-10"
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 SimpleLoadBal-PT-10, 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 r378-smll-171683810900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 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 ;